/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:00:11,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:00:11,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:00:11,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:00:11,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:00:11,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:00:11,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:00:11,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:00:11,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:00:11,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:00:11,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:00:11,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:00:11,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:00:11,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:00:11,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:00:11,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:00:11,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:00:11,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:00:11,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:00:11,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:00:11,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:00:11,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:00:11,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:00:11,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:00:11,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:00:11,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:00:11,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:00:11,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:00:11,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:00:11,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:00:11,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:00:11,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:00:11,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:00:11,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:00:11,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:00:11,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:00:11,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:00:11,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:00:11,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:00:11,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:00:11,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:00:11,264 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:00:11,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:00:11,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:00:11,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:00:11,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:00:11,284 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:00:11,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:00:11,285 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:00:11,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:00:11,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:00:11,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:00:11,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:00:11,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:00:11,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:00:11,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:00:11,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:00:11,287 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:00:11,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:00:11,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:00:11,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:00:11,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:00:11,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:00:11,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:00:11,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:00:11,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:00:11,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:00:11,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:00:11,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:00:11,290 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:00:11,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:00:11,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:00:11,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:00:11,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:00:11,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:00:11,590 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:00:11,590 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:00:11,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-18 22:00:11,662 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d87f476/a3d06926071f4ee1b0589c81a0a6b0d2/FLAG918a3db5d [2019-12-18 22:00:12,224 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:00:12,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-18 22:00:12,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d87f476/a3d06926071f4ee1b0589c81a0a6b0d2/FLAG918a3db5d [2019-12-18 22:00:12,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d87f476/a3d06926071f4ee1b0589c81a0a6b0d2 [2019-12-18 22:00:12,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:00:12,581 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:00:12,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:00:12,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:00:12,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:00:12,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:00:12" (1/1) ... [2019-12-18 22:00:12,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18eabf50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:12, skipping insertion in model container [2019-12-18 22:00:12,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:00:12" (1/1) ... [2019-12-18 22:00:12,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:00:12,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:00:13,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:00:13,251 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:00:13,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:00:13,396 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:00:13,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13 WrapperNode [2019-12-18 22:00:13,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:00:13,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:00:13,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:00:13,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:00:13,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:00:13,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:00:13,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:00:13,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:00:13,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... [2019-12-18 22:00:13,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:00:13,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:00:13,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:00:13,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:00:13,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:00:13,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:00:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:00:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:00:13,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:00:13,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:00:13,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:00:13,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:00:13,625 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:00:13,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:00:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:00:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:00:13,630 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:00:14,812 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:00:14,813 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:00:14,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:00:14 BoogieIcfgContainer [2019-12-18 22:00:14,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:00:14,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:00:14,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:00:14,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:00:14,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:00:12" (1/3) ... [2019-12-18 22:00:14,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75983be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:00:14, skipping insertion in model container [2019-12-18 22:00:14,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:00:13" (2/3) ... [2019-12-18 22:00:14,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75983be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:00:14, skipping insertion in model container [2019-12-18 22:00:14,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:00:14" (3/3) ... [2019-12-18 22:00:14,825 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.opt.i [2019-12-18 22:00:14,836 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:00:14,836 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:00:14,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:00:14,849 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:00:14,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,909 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,007 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,023 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:00:15,039 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:00:15,061 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:00:15,061 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:00:15,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:00:15,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:00:15,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:00:15,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:00:15,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:00:15,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:00:15,087 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 22:00:15,089 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 22:00:15,270 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 22:00:15,271 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:00:15,326 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 22:00:15,448 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 22:00:15,559 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 22:00:15,559 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:00:15,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 22:00:15,631 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 22:00:15,632 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:00:19,728 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 22:00:19,858 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 22:00:19,995 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-18 22:00:19,995 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-18 22:00:19,999 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-18 22:00:34,977 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-18 22:00:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-18 22:00:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:00:34,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:34,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:00:34,986 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:34,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-18 22:00:35,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:35,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157710905] [2019-12-18 22:00:35,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:35,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157710905] [2019-12-18 22:00:35,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:35,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:00:35,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419301559] [2019-12-18 22:00:35,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:00:35,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:00:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:35,262 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-18 22:00:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:38,362 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-18 22:00:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:00:38,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:00:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:39,196 INFO L225 Difference]: With dead ends: 120599 [2019-12-18 22:00:39,196 INFO L226 Difference]: Without dead ends: 118034 [2019-12-18 22:00:39,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:00:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-18 22:00:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-18 22:00:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-18 22:00:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-18 22:00:50,794 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-18 22:00:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:50,795 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-18 22:00:50,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:00:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-18 22:00:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:00:50,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:50,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:50,802 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-18 22:00:50,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:50,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984519440] [2019-12-18 22:00:50,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:50,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984519440] [2019-12-18 22:00:50,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:50,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:00:50,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870750311] [2019-12-18 22:00:50,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:00:50,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:50,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:00:50,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:00:50,924 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 4 states. [2019-12-18 22:00:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:56,506 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-18 22:00:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:00:56,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:00:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:57,097 INFO L225 Difference]: With dead ends: 156706 [2019-12-18 22:00:57,097 INFO L226 Difference]: Without dead ends: 156706 [2019-12-18 22:00:57,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:02,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-18 22:01:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-18 22:01:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-18 22:01:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-18 22:01:06,427 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-18 22:01:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:06,427 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-18 22:01:06,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:01:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-18 22:01:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:01:06,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:06,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:06,431 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:06,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-18 22:01:06,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:06,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162448312] [2019-12-18 22:01:06,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:01:06,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162448312] [2019-12-18 22:01:06,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:06,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:01:06,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904770561] [2019-12-18 22:01:06,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:01:06,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:01:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:01:06,514 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-18 22:01:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:13,301 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-18 22:01:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:01:13,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:01:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:13,813 INFO L225 Difference]: With dead ends: 203727 [2019-12-18 22:01:13,813 INFO L226 Difference]: Without dead ends: 203727 [2019-12-18 22:01:13,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-18 22:01:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-18 22:01:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-18 22:01:24,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-18 22:01:24,204 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-18 22:01:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:24,204 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-18 22:01:24,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:01:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-18 22:01:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 22:01:24,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:24,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:24,210 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-18 22:01:24,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:24,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140652636] [2019-12-18 22:01:24,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:01:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140652636] [2019-12-18 22:01:24,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:24,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:01:24,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171903192] [2019-12-18 22:01:24,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:01:24,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:24,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:01:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:01:24,311 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 5 states. [2019-12-18 22:01:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:26,201 INFO L93 Difference]: Finished difference Result 251197 states and 891926 transitions. [2019-12-18 22:01:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:01:26,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 22:01:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:33,917 INFO L225 Difference]: With dead ends: 251197 [2019-12-18 22:01:33,917 INFO L226 Difference]: Without dead ends: 251197 [2019-12-18 22:01:33,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:01:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251197 states. [2019-12-18 22:01:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251197 to 188159. [2019-12-18 22:01:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188159 states. [2019-12-18 22:01:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188159 states to 188159 states and 679985 transitions. [2019-12-18 22:01:43,232 INFO L78 Accepts]: Start accepts. Automaton has 188159 states and 679985 transitions. Word has length 17 [2019-12-18 22:01:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:01:43,232 INFO L462 AbstractCegarLoop]: Abstraction has 188159 states and 679985 transitions. [2019-12-18 22:01:43,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:01:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 188159 states and 679985 transitions. [2019-12-18 22:01:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:01:43,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:01:43,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:01:43,259 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:01:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:01:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-18 22:01:43,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:01:43,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637936484] [2019-12-18 22:01:43,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:01:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:01:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:01:43,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637936484] [2019-12-18 22:01:43,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:01:43,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:01:43,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045446678] [2019-12-18 22:01:43,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:01:43,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:01:43,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:01:43,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:01:43,429 INFO L87 Difference]: Start difference. First operand 188159 states and 679985 transitions. Second operand 6 states. [2019-12-18 22:01:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:01:46,394 INFO L93 Difference]: Finished difference Result 258327 states and 918716 transitions. [2019-12-18 22:01:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:01:46,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 22:01:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:01:53,826 INFO L225 Difference]: With dead ends: 258327 [2019-12-18 22:01:53,826 INFO L226 Difference]: Without dead ends: 258327 [2019-12-18 22:01:53,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:01:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258327 states. [2019-12-18 22:02:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258327 to 243454. [2019-12-18 22:02:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243454 states. [2019-12-18 22:02:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243454 states to 243454 states and 868009 transitions. [2019-12-18 22:02:04,477 INFO L78 Accepts]: Start accepts. Automaton has 243454 states and 868009 transitions. Word has length 25 [2019-12-18 22:02:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:04,478 INFO L462 AbstractCegarLoop]: Abstraction has 243454 states and 868009 transitions. [2019-12-18 22:02:04,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 243454 states and 868009 transitions. [2019-12-18 22:02:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:02:04,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:04,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:04,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:04,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash 144894900, now seen corresponding path program 1 times [2019-12-18 22:02:04,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:04,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844629626] [2019-12-18 22:02:04,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:04,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844629626] [2019-12-18 22:02:04,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:04,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:02:04,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218533548] [2019-12-18 22:02:04,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:02:04,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:02:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:02:04,610 INFO L87 Difference]: Start difference. First operand 243454 states and 868009 transitions. Second operand 4 states. [2019-12-18 22:02:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:04,683 INFO L93 Difference]: Finished difference Result 14903 states and 40512 transitions. [2019-12-18 22:02:04,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:02:04,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:02:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:04,695 INFO L225 Difference]: With dead ends: 14903 [2019-12-18 22:02:04,696 INFO L226 Difference]: Without dead ends: 10760 [2019-12-18 22:02:04,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:02:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10760 states. [2019-12-18 22:02:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10760 to 10720. [2019-12-18 22:02:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10720 states. [2019-12-18 22:02:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 26331 transitions. [2019-12-18 22:02:04,826 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 26331 transitions. Word has length 25 [2019-12-18 22:02:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:04,827 INFO L462 AbstractCegarLoop]: Abstraction has 10720 states and 26331 transitions. [2019-12-18 22:02:04,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:02:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 26331 transitions. [2019-12-18 22:02:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 22:02:04,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:04,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:04,831 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-18 22:02:04,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:04,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178307596] [2019-12-18 22:02:04,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:04,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178307596] [2019-12-18 22:02:04,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:04,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:04,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590285116] [2019-12-18 22:02:04,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:04,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:04,957 INFO L87 Difference]: Start difference. First operand 10720 states and 26331 transitions. Second operand 7 states. [2019-12-18 22:02:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:06,063 INFO L93 Difference]: Finished difference Result 12029 states and 29137 transitions. [2019-12-18 22:02:06,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:02:06,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 22:02:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:06,078 INFO L225 Difference]: With dead ends: 12029 [2019-12-18 22:02:06,079 INFO L226 Difference]: Without dead ends: 11981 [2019-12-18 22:02:06,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-12-18 22:02:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11601. [2019-12-18 22:02:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-12-18 22:02:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 28281 transitions. [2019-12-18 22:02:08,077 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 28281 transitions. Word has length 38 [2019-12-18 22:02:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:08,077 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 28281 transitions. [2019-12-18 22:02:08,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 28281 transitions. [2019-12-18 22:02:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 22:02:08,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:08,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:08,084 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:08,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-18 22:02:08,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:08,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402161010] [2019-12-18 22:02:08,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:08,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402161010] [2019-12-18 22:02:08,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:08,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:08,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799693091] [2019-12-18 22:02:08,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:02:08,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:08,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:02:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:08,357 INFO L87 Difference]: Start difference. First operand 11601 states and 28281 transitions. Second operand 8 states. [2019-12-18 22:02:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:09,915 INFO L93 Difference]: Finished difference Result 13284 states and 32064 transitions. [2019-12-18 22:02:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:02:09,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-18 22:02:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:09,933 INFO L225 Difference]: With dead ends: 13284 [2019-12-18 22:02:09,934 INFO L226 Difference]: Without dead ends: 13284 [2019-12-18 22:02:09,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:02:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2019-12-18 22:02:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 11783. [2019-12-18 22:02:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-18 22:02:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-18 22:02:10,092 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-18 22:02:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:10,093 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-18 22:02:10,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:02:10,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-18 22:02:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 22:02:10,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:10,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:10,103 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-18 22:02:10,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:10,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386544592] [2019-12-18 22:02:10,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:10,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386544592] [2019-12-18 22:02:10,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:10,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:10,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654470554] [2019-12-18 22:02:10,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:02:10,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:02:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:02:10,193 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-18 22:02:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:11,130 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-18 22:02:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:02:11,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 22:02:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:11,150 INFO L225 Difference]: With dead ends: 13164 [2019-12-18 22:02:11,150 INFO L226 Difference]: Without dead ends: 13164 [2019-12-18 22:02:11,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-18 22:02:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-18 22:02:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-18 22:02:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-18 22:02:11,304 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-18 22:02:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:11,305 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-18 22:02:11,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:02:11,305 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-18 22:02:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 22:02:11,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:11,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:11,315 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:11,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:11,315 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-18 22:02:11,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:11,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281393339] [2019-12-18 22:02:11,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:11,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281393339] [2019-12-18 22:02:11,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:11,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:11,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602410563] [2019-12-18 22:02:11,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:11,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:11,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:11,617 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 11 states. [2019-12-18 22:02:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:13,298 INFO L93 Difference]: Finished difference Result 21596 states and 52464 transitions. [2019-12-18 22:02:13,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:02:13,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 22:02:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:13,321 INFO L225 Difference]: With dead ends: 21596 [2019-12-18 22:02:13,321 INFO L226 Difference]: Without dead ends: 21158 [2019-12-18 22:02:13,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:02:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21158 states. [2019-12-18 22:02:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21158 to 14512. [2019-12-18 22:02:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14512 states. [2019-12-18 22:02:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14512 states to 14512 states and 35219 transitions. [2019-12-18 22:02:13,517 INFO L78 Accepts]: Start accepts. Automaton has 14512 states and 35219 transitions. Word has length 58 [2019-12-18 22:02:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:13,518 INFO L462 AbstractCegarLoop]: Abstraction has 14512 states and 35219 transitions. [2019-12-18 22:02:13,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 14512 states and 35219 transitions. [2019-12-18 22:02:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 22:02:13,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:13,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:13,531 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash 829880521, now seen corresponding path program 1 times [2019-12-18 22:02:13,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:13,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682585828] [2019-12-18 22:02:13,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:13,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682585828] [2019-12-18 22:02:13,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:13,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:02:13,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915997373] [2019-12-18 22:02:13,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:02:13,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:13,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:02:13,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:02:13,630 INFO L87 Difference]: Start difference. First operand 14512 states and 35219 transitions. Second operand 5 states. [2019-12-18 22:02:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:13,686 INFO L93 Difference]: Finished difference Result 7303 states and 17313 transitions. [2019-12-18 22:02:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:02:13,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 22:02:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:13,697 INFO L225 Difference]: With dead ends: 7303 [2019-12-18 22:02:13,697 INFO L226 Difference]: Without dead ends: 7031 [2019-12-18 22:02:13,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7031 states. [2019-12-18 22:02:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7031 to 6830. [2019-12-18 22:02:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6830 states. [2019-12-18 22:02:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 16343 transitions. [2019-12-18 22:02:13,778 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 16343 transitions. Word has length 64 [2019-12-18 22:02:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:13,778 INFO L462 AbstractCegarLoop]: Abstraction has 6830 states and 16343 transitions. [2019-12-18 22:02:13,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:02:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 16343 transitions. [2019-12-18 22:02:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:02:13,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:13,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:13,789 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-18 22:02:13,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:13,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115249163] [2019-12-18 22:02:13,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:13,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115249163] [2019-12-18 22:02:13,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:13,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:13,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790029452] [2019-12-18 22:02:13,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:13,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:13,883 INFO L87 Difference]: Start difference. First operand 6830 states and 16343 transitions. Second operand 6 states. [2019-12-18 22:02:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:14,689 INFO L93 Difference]: Finished difference Result 8744 states and 20664 transitions. [2019-12-18 22:02:14,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:02:14,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 22:02:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:14,701 INFO L225 Difference]: With dead ends: 8744 [2019-12-18 22:02:14,701 INFO L226 Difference]: Without dead ends: 8744 [2019-12-18 22:02:14,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2019-12-18 22:02:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 8285. [2019-12-18 22:02:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8285 states. [2019-12-18 22:02:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8285 states to 8285 states and 19696 transitions. [2019-12-18 22:02:14,796 INFO L78 Accepts]: Start accepts. Automaton has 8285 states and 19696 transitions. Word has length 94 [2019-12-18 22:02:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:14,797 INFO L462 AbstractCegarLoop]: Abstraction has 8285 states and 19696 transitions. [2019-12-18 22:02:14,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8285 states and 19696 transitions. [2019-12-18 22:02:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:02:14,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:14,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:14,809 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash 275007721, now seen corresponding path program 2 times [2019-12-18 22:02:14,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:14,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062772292] [2019-12-18 22:02:14,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:14,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062772292] [2019-12-18 22:02:14,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:14,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:14,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862750785] [2019-12-18 22:02:14,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:14,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:14,925 INFO L87 Difference]: Start difference. First operand 8285 states and 19696 transitions. Second operand 7 states. [2019-12-18 22:02:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:15,933 INFO L93 Difference]: Finished difference Result 9665 states and 22767 transitions. [2019-12-18 22:02:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:02:15,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 22:02:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:15,947 INFO L225 Difference]: With dead ends: 9665 [2019-12-18 22:02:15,947 INFO L226 Difference]: Without dead ends: 9665 [2019-12-18 22:02:15,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:02:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9665 states. [2019-12-18 22:02:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9665 to 8568. [2019-12-18 22:02:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8568 states. [2019-12-18 22:02:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8568 states to 8568 states and 20330 transitions. [2019-12-18 22:02:16,059 INFO L78 Accepts]: Start accepts. Automaton has 8568 states and 20330 transitions. Word has length 94 [2019-12-18 22:02:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:16,059 INFO L462 AbstractCegarLoop]: Abstraction has 8568 states and 20330 transitions. [2019-12-18 22:02:16,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 8568 states and 20330 transitions. [2019-12-18 22:02:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:02:16,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:16,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:16,069 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash -860704691, now seen corresponding path program 3 times [2019-12-18 22:02:16,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:16,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583010677] [2019-12-18 22:02:16,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:16,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583010677] [2019-12-18 22:02:16,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:16,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:16,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259067007] [2019-12-18 22:02:16,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:02:16,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:16,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:02:16,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:02:16,168 INFO L87 Difference]: Start difference. First operand 8568 states and 20330 transitions. Second operand 5 states. [2019-12-18 22:02:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:16,743 INFO L93 Difference]: Finished difference Result 9086 states and 21396 transitions. [2019-12-18 22:02:16,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:02:16,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 22:02:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:16,756 INFO L225 Difference]: With dead ends: 9086 [2019-12-18 22:02:16,756 INFO L226 Difference]: Without dead ends: 9086 [2019-12-18 22:02:16,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2019-12-18 22:02:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8709. [2019-12-18 22:02:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8709 states. [2019-12-18 22:02:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 20648 transitions. [2019-12-18 22:02:16,978 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 20648 transitions. Word has length 94 [2019-12-18 22:02:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:16,979 INFO L462 AbstractCegarLoop]: Abstraction has 8709 states and 20648 transitions. [2019-12-18 22:02:16,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:02:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 20648 transitions. [2019-12-18 22:02:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 22:02:16,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:16,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:16,987 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1714542913, now seen corresponding path program 4 times [2019-12-18 22:02:16,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:16,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612799174] [2019-12-18 22:02:16,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:17,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612799174] [2019-12-18 22:02:17,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:17,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:02:17,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774122028] [2019-12-18 22:02:17,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:02:17,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:02:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:02:17,110 INFO L87 Difference]: Start difference. First operand 8709 states and 20648 transitions. Second operand 3 states. [2019-12-18 22:02:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:17,174 INFO L93 Difference]: Finished difference Result 8709 states and 20647 transitions. [2019-12-18 22:02:17,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:02:17,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 22:02:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:17,187 INFO L225 Difference]: With dead ends: 8709 [2019-12-18 22:02:17,187 INFO L226 Difference]: Without dead ends: 8709 [2019-12-18 22:02:17,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:02:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2019-12-18 22:02:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 8585. [2019-12-18 22:02:17,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8585 states. [2019-12-18 22:02:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8585 states to 8585 states and 20418 transitions. [2019-12-18 22:02:17,299 INFO L78 Accepts]: Start accepts. Automaton has 8585 states and 20418 transitions. Word has length 94 [2019-12-18 22:02:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:17,299 INFO L462 AbstractCegarLoop]: Abstraction has 8585 states and 20418 transitions. [2019-12-18 22:02:17,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:02:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 8585 states and 20418 transitions. [2019-12-18 22:02:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:17,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:17,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:17,308 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:17,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash 874014353, now seen corresponding path program 1 times [2019-12-18 22:02:17,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:17,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213652648] [2019-12-18 22:02:17,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:17,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213652648] [2019-12-18 22:02:17,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:17,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:02:17,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945485621] [2019-12-18 22:02:17,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:02:17,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:02:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:02:17,462 INFO L87 Difference]: Start difference. First operand 8585 states and 20418 transitions. Second operand 9 states. [2019-12-18 22:02:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:18,229 INFO L93 Difference]: Finished difference Result 14984 states and 35500 transitions. [2019-12-18 22:02:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:02:18,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-18 22:02:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:18,247 INFO L225 Difference]: With dead ends: 14984 [2019-12-18 22:02:18,248 INFO L226 Difference]: Without dead ends: 12309 [2019-12-18 22:02:18,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:02:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12309 states. [2019-12-18 22:02:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12309 to 10140. [2019-12-18 22:02:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10140 states. [2019-12-18 22:02:18,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10140 states to 10140 states and 24289 transitions. [2019-12-18 22:02:18,369 INFO L78 Accepts]: Start accepts. Automaton has 10140 states and 24289 transitions. Word has length 95 [2019-12-18 22:02:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:18,369 INFO L462 AbstractCegarLoop]: Abstraction has 10140 states and 24289 transitions. [2019-12-18 22:02:18,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:02:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10140 states and 24289 transitions. [2019-12-18 22:02:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:18,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:18,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:18,383 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:18,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash -510698891, now seen corresponding path program 2 times [2019-12-18 22:02:18,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:18,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260458926] [2019-12-18 22:02:18,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:18,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260458926] [2019-12-18 22:02:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:18,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:18,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352578679] [2019-12-18 22:02:18,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:18,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:18,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:18,535 INFO L87 Difference]: Start difference. First operand 10140 states and 24289 transitions. Second operand 10 states. [2019-12-18 22:02:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:19,498 INFO L93 Difference]: Finished difference Result 16608 states and 39691 transitions. [2019-12-18 22:02:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:02:19,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 22:02:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:19,516 INFO L225 Difference]: With dead ends: 16608 [2019-12-18 22:02:19,516 INFO L226 Difference]: Without dead ends: 14779 [2019-12-18 22:02:19,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:02:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14779 states. [2019-12-18 22:02:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14779 to 10310. [2019-12-18 22:02:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10310 states. [2019-12-18 22:02:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10310 states to 10310 states and 24691 transitions. [2019-12-18 22:02:19,645 INFO L78 Accepts]: Start accepts. Automaton has 10310 states and 24691 transitions. Word has length 95 [2019-12-18 22:02:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:19,645 INFO L462 AbstractCegarLoop]: Abstraction has 10310 states and 24691 transitions. [2019-12-18 22:02:19,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10310 states and 24691 transitions. [2019-12-18 22:02:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:19,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:19,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:19,658 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:19,658 INFO L82 PathProgramCache]: Analyzing trace with hash 800944117, now seen corresponding path program 3 times [2019-12-18 22:02:19,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:19,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455853866] [2019-12-18 22:02:19,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:19,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455853866] [2019-12-18 22:02:19,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:19,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:19,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845811545] [2019-12-18 22:02:19,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:19,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:19,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:19,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:19,824 INFO L87 Difference]: Start difference. First operand 10310 states and 24691 transitions. Second operand 10 states. [2019-12-18 22:02:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:20,769 INFO L93 Difference]: Finished difference Result 14356 states and 33993 transitions. [2019-12-18 22:02:20,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:02:20,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 22:02:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:20,784 INFO L225 Difference]: With dead ends: 14356 [2019-12-18 22:02:20,784 INFO L226 Difference]: Without dead ends: 11352 [2019-12-18 22:02:20,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:02:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11352 states. [2019-12-18 22:02:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11352 to 9728. [2019-12-18 22:02:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9728 states. [2019-12-18 22:02:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9728 states to 9728 states and 23002 transitions. [2019-12-18 22:02:20,903 INFO L78 Accepts]: Start accepts. Automaton has 9728 states and 23002 transitions. Word has length 95 [2019-12-18 22:02:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:20,903 INFO L462 AbstractCegarLoop]: Abstraction has 9728 states and 23002 transitions. [2019-12-18 22:02:20,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9728 states and 23002 transitions. [2019-12-18 22:02:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:20,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:20,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:20,915 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1807958155, now seen corresponding path program 4 times [2019-12-18 22:02:20,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:20,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030125792] [2019-12-18 22:02:20,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:21,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030125792] [2019-12-18 22:02:21,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:21,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:21,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504573954] [2019-12-18 22:02:21,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:21,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:21,004 INFO L87 Difference]: Start difference. First operand 9728 states and 23002 transitions. Second operand 6 states. [2019-12-18 22:02:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:21,693 INFO L93 Difference]: Finished difference Result 10264 states and 24055 transitions. [2019-12-18 22:02:21,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:02:21,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 22:02:21,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:21,705 INFO L225 Difference]: With dead ends: 10264 [2019-12-18 22:02:21,706 INFO L226 Difference]: Without dead ends: 10264 [2019-12-18 22:02:21,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10264 states. [2019-12-18 22:02:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10264 to 9758. [2019-12-18 22:02:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9758 states. [2019-12-18 22:02:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9758 states to 9758 states and 23057 transitions. [2019-12-18 22:02:21,809 INFO L78 Accepts]: Start accepts. Automaton has 9758 states and 23057 transitions. Word has length 95 [2019-12-18 22:02:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:21,809 INFO L462 AbstractCegarLoop]: Abstraction has 9758 states and 23057 transitions. [2019-12-18 22:02:21,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 9758 states and 23057 transitions. [2019-12-18 22:02:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:21,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:21,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:21,818 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:21,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash -954484805, now seen corresponding path program 5 times [2019-12-18 22:02:21,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:21,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520437131] [2019-12-18 22:02:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:21,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520437131] [2019-12-18 22:02:21,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:21,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:21,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809709293] [2019-12-18 22:02:21,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:21,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:21,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:21,933 INFO L87 Difference]: Start difference. First operand 9758 states and 23057 transitions. Second operand 7 states. [2019-12-18 22:02:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:22,947 INFO L93 Difference]: Finished difference Result 14326 states and 34041 transitions. [2019-12-18 22:02:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:02:22,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 22:02:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:22,964 INFO L225 Difference]: With dead ends: 14326 [2019-12-18 22:02:22,965 INFO L226 Difference]: Without dead ends: 14140 [2019-12-18 22:02:22,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:02:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14140 states. [2019-12-18 22:02:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14140 to 10715. [2019-12-18 22:02:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10715 states. [2019-12-18 22:02:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 25183 transitions. [2019-12-18 22:02:23,092 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 25183 transitions. Word has length 95 [2019-12-18 22:02:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:23,092 INFO L462 AbstractCegarLoop]: Abstraction has 10715 states and 25183 transitions. [2019-12-18 22:02:23,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 25183 transitions. [2019-12-18 22:02:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:23,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:23,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:23,102 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1330754899, now seen corresponding path program 6 times [2019-12-18 22:02:23,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:23,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140393276] [2019-12-18 22:02:23,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:23,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140393276] [2019-12-18 22:02:23,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:23,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:23,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580925873] [2019-12-18 22:02:23,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:02:23,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:02:23,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:02:23,256 INFO L87 Difference]: Start difference. First operand 10715 states and 25183 transitions. Second operand 9 states. [2019-12-18 22:02:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:25,021 INFO L93 Difference]: Finished difference Result 15188 states and 36041 transitions. [2019-12-18 22:02:25,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:02:25,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-18 22:02:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:25,040 INFO L225 Difference]: With dead ends: 15188 [2019-12-18 22:02:25,040 INFO L226 Difference]: Without dead ends: 15188 [2019-12-18 22:02:25,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:02:25,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15188 states. [2019-12-18 22:02:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15188 to 9901. [2019-12-18 22:02:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9901 states. [2019-12-18 22:02:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9901 states to 9901 states and 23342 transitions. [2019-12-18 22:02:25,186 INFO L78 Accepts]: Start accepts. Automaton has 9901 states and 23342 transitions. Word has length 95 [2019-12-18 22:02:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:25,186 INFO L462 AbstractCegarLoop]: Abstraction has 9901 states and 23342 transitions. [2019-12-18 22:02:25,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:02:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9901 states and 23342 transitions. [2019-12-18 22:02:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:25,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:25,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:25,196 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1272736377, now seen corresponding path program 7 times [2019-12-18 22:02:25,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:25,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933426815] [2019-12-18 22:02:25,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:25,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933426815] [2019-12-18 22:02:25,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:25,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:25,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435647606] [2019-12-18 22:02:25,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:25,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:25,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:25,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:25,394 INFO L87 Difference]: Start difference. First operand 9901 states and 23342 transitions. Second operand 10 states. [2019-12-18 22:02:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:26,469 INFO L93 Difference]: Finished difference Result 22209 states and 51407 transitions. [2019-12-18 22:02:26,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:02:26,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 22:02:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:26,492 INFO L225 Difference]: With dead ends: 22209 [2019-12-18 22:02:26,492 INFO L226 Difference]: Without dead ends: 20005 [2019-12-18 22:02:26,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:02:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20005 states. [2019-12-18 22:02:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20005 to 13593. [2019-12-18 22:02:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13593 states. [2019-12-18 22:02:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13593 states to 13593 states and 32618 transitions. [2019-12-18 22:02:26,689 INFO L78 Accepts]: Start accepts. Automaton has 13593 states and 32618 transitions. Word has length 95 [2019-12-18 22:02:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:26,689 INFO L462 AbstractCegarLoop]: Abstraction has 13593 states and 32618 transitions. [2019-12-18 22:02:26,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 13593 states and 32618 transitions. [2019-12-18 22:02:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:26,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:26,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:26,702 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1421503801, now seen corresponding path program 8 times [2019-12-18 22:02:26,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:26,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695347378] [2019-12-18 22:02:26,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:26,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695347378] [2019-12-18 22:02:26,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:26,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:02:26,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362224222] [2019-12-18 22:02:26,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:02:26,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:26,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:02:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:26,811 INFO L87 Difference]: Start difference. First operand 13593 states and 32618 transitions. Second operand 8 states. [2019-12-18 22:02:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:28,054 INFO L93 Difference]: Finished difference Result 18732 states and 43903 transitions. [2019-12-18 22:02:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:02:28,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-18 22:02:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:28,075 INFO L225 Difference]: With dead ends: 18732 [2019-12-18 22:02:28,075 INFO L226 Difference]: Without dead ends: 18405 [2019-12-18 22:02:28,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:02:28,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18405 states. [2019-12-18 22:02:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18405 to 15053. [2019-12-18 22:02:28,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15053 states. [2019-12-18 22:02:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 35988 transitions. [2019-12-18 22:02:28,262 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 35988 transitions. Word has length 95 [2019-12-18 22:02:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:28,262 INFO L462 AbstractCegarLoop]: Abstraction has 15053 states and 35988 transitions. [2019-12-18 22:02:28,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:02:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 35988 transitions. [2019-12-18 22:02:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:28,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:28,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:28,277 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1494482243, now seen corresponding path program 9 times [2019-12-18 22:02:28,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:28,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086154291] [2019-12-18 22:02:28,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:28,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086154291] [2019-12-18 22:02:28,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:28,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:02:28,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113128984] [2019-12-18 22:02:28,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:02:28,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:02:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:28,508 INFO L87 Difference]: Start difference. First operand 15053 states and 35988 transitions. Second operand 8 states. [2019-12-18 22:02:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:29,639 INFO L93 Difference]: Finished difference Result 19701 states and 46104 transitions. [2019-12-18 22:02:29,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:02:29,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-18 22:02:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:29,661 INFO L225 Difference]: With dead ends: 19701 [2019-12-18 22:02:29,661 INFO L226 Difference]: Without dead ends: 19385 [2019-12-18 22:02:29,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:02:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19385 states. [2019-12-18 22:02:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19385 to 14061. [2019-12-18 22:02:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14061 states. [2019-12-18 22:02:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14061 states to 14061 states and 33730 transitions. [2019-12-18 22:02:29,847 INFO L78 Accepts]: Start accepts. Automaton has 14061 states and 33730 transitions. Word has length 95 [2019-12-18 22:02:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:29,848 INFO L462 AbstractCegarLoop]: Abstraction has 14061 states and 33730 transitions. [2019-12-18 22:02:29,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:02:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 14061 states and 33730 transitions. [2019-12-18 22:02:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:02:29,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:29,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:29,861 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2063466195, now seen corresponding path program 10 times [2019-12-18 22:02:29,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:29,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245453239] [2019-12-18 22:02:29,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:29,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245453239] [2019-12-18 22:02:29,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:29,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:29,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942070535] [2019-12-18 22:02:29,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:29,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:29,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:29,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:29,966 INFO L87 Difference]: Start difference. First operand 14061 states and 33730 transitions. Second operand 7 states. [2019-12-18 22:02:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:30,187 INFO L93 Difference]: Finished difference Result 10204 states and 24788 transitions. [2019-12-18 22:02:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:02:30,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 22:02:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:30,205 INFO L225 Difference]: With dead ends: 10204 [2019-12-18 22:02:30,205 INFO L226 Difference]: Without dead ends: 10204 [2019-12-18 22:02:30,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:02:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10204 states. [2019-12-18 22:02:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10204 to 10003. [2019-12-18 22:02:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10003 states. [2019-12-18 22:02:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 24381 transitions. [2019-12-18 22:02:30,410 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 24381 transitions. Word has length 95 [2019-12-18 22:02:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:30,410 INFO L462 AbstractCegarLoop]: Abstraction has 10003 states and 24381 transitions. [2019-12-18 22:02:30,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 24381 transitions. [2019-12-18 22:02:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:30,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:30,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:30,424 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 509064979, now seen corresponding path program 1 times [2019-12-18 22:02:30,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:30,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787410088] [2019-12-18 22:02:30,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:30,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787410088] [2019-12-18 22:02:30,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:30,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:02:30,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571921714] [2019-12-18 22:02:30,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:02:30,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:30,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:02:30,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:02:30,499 INFO L87 Difference]: Start difference. First operand 10003 states and 24381 transitions. Second operand 4 states. [2019-12-18 22:02:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:30,764 INFO L93 Difference]: Finished difference Result 11235 states and 27320 transitions. [2019-12-18 22:02:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:02:30,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-18 22:02:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:30,778 INFO L225 Difference]: With dead ends: 11235 [2019-12-18 22:02:30,778 INFO L226 Difference]: Without dead ends: 11235 [2019-12-18 22:02:30,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:02:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2019-12-18 22:02:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 10426. [2019-12-18 22:02:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10426 states. [2019-12-18 22:02:30,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10426 states to 10426 states and 25343 transitions. [2019-12-18 22:02:30,904 INFO L78 Accepts]: Start accepts. Automaton has 10426 states and 25343 transitions. Word has length 97 [2019-12-18 22:02:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:30,904 INFO L462 AbstractCegarLoop]: Abstraction has 10426 states and 25343 transitions. [2019-12-18 22:02:30,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:02:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10426 states and 25343 transitions. [2019-12-18 22:02:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:30,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:30,915 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:30,915 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1176229779, now seen corresponding path program 2 times [2019-12-18 22:02:30,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:30,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369937609] [2019-12-18 22:02:30,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:31,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369937609] [2019-12-18 22:02:31,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:31,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:31,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348246593] [2019-12-18 22:02:31,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:31,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:31,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:31,018 INFO L87 Difference]: Start difference. First operand 10426 states and 25343 transitions. Second operand 6 states. [2019-12-18 22:02:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:31,160 INFO L93 Difference]: Finished difference Result 11637 states and 27887 transitions. [2019-12-18 22:02:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:02:31,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 22:02:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:31,173 INFO L225 Difference]: With dead ends: 11637 [2019-12-18 22:02:31,173 INFO L226 Difference]: Without dead ends: 10729 [2019-12-18 22:02:31,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:02:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2019-12-18 22:02:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10685. [2019-12-18 22:02:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10685 states. [2019-12-18 22:02:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10685 states to 10685 states and 25938 transitions. [2019-12-18 22:02:31,290 INFO L78 Accepts]: Start accepts. Automaton has 10685 states and 25938 transitions. Word has length 97 [2019-12-18 22:02:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:31,291 INFO L462 AbstractCegarLoop]: Abstraction has 10685 states and 25938 transitions. [2019-12-18 22:02:31,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 10685 states and 25938 transitions. [2019-12-18 22:02:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:31,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:31,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:31,302 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash -166061845, now seen corresponding path program 3 times [2019-12-18 22:02:31,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:31,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025710554] [2019-12-18 22:02:31,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:31,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025710554] [2019-12-18 22:02:31,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:31,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:02:31,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824346019] [2019-12-18 22:02:31,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:02:31,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:31,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:02:31,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:02:31,653 INFO L87 Difference]: Start difference. First operand 10685 states and 25938 transitions. Second operand 16 states. [2019-12-18 22:02:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:34,808 INFO L93 Difference]: Finished difference Result 19294 states and 46615 transitions. [2019-12-18 22:02:34,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 22:02:34,808 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2019-12-18 22:02:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:34,831 INFO L225 Difference]: With dead ends: 19294 [2019-12-18 22:02:34,831 INFO L226 Difference]: Without dead ends: 18521 [2019-12-18 22:02:34,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:02:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18521 states. [2019-12-18 22:02:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18521 to 14506. [2019-12-18 22:02:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14506 states. [2019-12-18 22:02:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14506 states to 14506 states and 36105 transitions. [2019-12-18 22:02:35,044 INFO L78 Accepts]: Start accepts. Automaton has 14506 states and 36105 transitions. Word has length 97 [2019-12-18 22:02:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:35,044 INFO L462 AbstractCegarLoop]: Abstraction has 14506 states and 36105 transitions. [2019-12-18 22:02:35,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:02:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 14506 states and 36105 transitions. [2019-12-18 22:02:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:35,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:35,059 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:35,059 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1327631825, now seen corresponding path program 4 times [2019-12-18 22:02:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697050829] [2019-12-18 22:02:35,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:35,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697050829] [2019-12-18 22:02:35,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:35,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:02:35,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975321991] [2019-12-18 22:02:35,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:02:35,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:02:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:02:35,153 INFO L87 Difference]: Start difference. First operand 14506 states and 36105 transitions. Second operand 5 states. [2019-12-18 22:02:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:35,660 INFO L93 Difference]: Finished difference Result 19214 states and 48179 transitions. [2019-12-18 22:02:35,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:02:35,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-18 22:02:35,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:35,684 INFO L225 Difference]: With dead ends: 19214 [2019-12-18 22:02:35,685 INFO L226 Difference]: Without dead ends: 19214 [2019-12-18 22:02:35,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19214 states. [2019-12-18 22:02:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19214 to 16755. [2019-12-18 22:02:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16755 states. [2019-12-18 22:02:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 41927 transitions. [2019-12-18 22:02:35,891 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 41927 transitions. Word has length 97 [2019-12-18 22:02:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:35,891 INFO L462 AbstractCegarLoop]: Abstraction has 16755 states and 41927 transitions. [2019-12-18 22:02:35,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:02:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 41927 transitions. [2019-12-18 22:02:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:35,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:35,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:35,907 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:35,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash 627268243, now seen corresponding path program 5 times [2019-12-18 22:02:35,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:35,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187613694] [2019-12-18 22:02:35,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:36,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187613694] [2019-12-18 22:02:36,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:36,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:36,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200717039] [2019-12-18 22:02:36,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:02:36,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:02:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:02:36,055 INFO L87 Difference]: Start difference. First operand 16755 states and 41927 transitions. Second operand 7 states. [2019-12-18 22:02:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:37,263 INFO L93 Difference]: Finished difference Result 23241 states and 58049 transitions. [2019-12-18 22:02:37,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:02:37,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 22:02:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:37,289 INFO L225 Difference]: With dead ends: 23241 [2019-12-18 22:02:37,289 INFO L226 Difference]: Without dead ends: 23241 [2019-12-18 22:02:37,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23241 states. [2019-12-18 22:02:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23241 to 17557. [2019-12-18 22:02:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17557 states. [2019-12-18 22:02:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17557 states to 17557 states and 43896 transitions. [2019-12-18 22:02:37,522 INFO L78 Accepts]: Start accepts. Automaton has 17557 states and 43896 transitions. Word has length 97 [2019-12-18 22:02:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:37,522 INFO L462 AbstractCegarLoop]: Abstraction has 17557 states and 43896 transitions. [2019-12-18 22:02:37,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:02:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17557 states and 43896 transitions. [2019-12-18 22:02:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:37,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:37,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:37,539 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1887530979, now seen corresponding path program 6 times [2019-12-18 22:02:37,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:37,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938546681] [2019-12-18 22:02:37,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:37,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938546681] [2019-12-18 22:02:37,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:37,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:02:37,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523622414] [2019-12-18 22:02:37,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:02:37,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:02:37,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:02:37,634 INFO L87 Difference]: Start difference. First operand 17557 states and 43896 transitions. Second operand 6 states. [2019-12-18 22:02:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:38,182 INFO L93 Difference]: Finished difference Result 22305 states and 55782 transitions. [2019-12-18 22:02:38,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:02:38,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 22:02:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:38,211 INFO L225 Difference]: With dead ends: 22305 [2019-12-18 22:02:38,212 INFO L226 Difference]: Without dead ends: 22305 [2019-12-18 22:02:38,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22305 states. [2019-12-18 22:02:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22305 to 18621. [2019-12-18 22:02:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2019-12-18 22:02:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 46590 transitions. [2019-12-18 22:02:38,474 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 46590 transitions. Word has length 97 [2019-12-18 22:02:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:38,475 INFO L462 AbstractCegarLoop]: Abstraction has 18621 states and 46590 transitions. [2019-12-18 22:02:38,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:02:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 46590 transitions. [2019-12-18 22:02:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:38,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:38,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:38,494 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:38,495 INFO L82 PathProgramCache]: Analyzing trace with hash 67369089, now seen corresponding path program 7 times [2019-12-18 22:02:38,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:38,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570080856] [2019-12-18 22:02:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:38,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:38,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570080856] [2019-12-18 22:02:38,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:38,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:02:38,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737308495] [2019-12-18 22:02:38,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:02:38,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:02:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:02:38,611 INFO L87 Difference]: Start difference. First operand 18621 states and 46590 transitions. Second operand 8 states. [2019-12-18 22:02:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:39,657 INFO L93 Difference]: Finished difference Result 21921 states and 54229 transitions. [2019-12-18 22:02:39,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:02:39,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 22:02:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:39,681 INFO L225 Difference]: With dead ends: 21921 [2019-12-18 22:02:39,681 INFO L226 Difference]: Without dead ends: 21921 [2019-12-18 22:02:39,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:02:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21921 states. [2019-12-18 22:02:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21921 to 17573. [2019-12-18 22:02:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17573 states. [2019-12-18 22:02:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17573 states to 17573 states and 43934 transitions. [2019-12-18 22:02:40,075 INFO L78 Accepts]: Start accepts. Automaton has 17573 states and 43934 transitions. Word has length 97 [2019-12-18 22:02:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:40,075 INFO L462 AbstractCegarLoop]: Abstraction has 17573 states and 43934 transitions. [2019-12-18 22:02:40,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:02:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17573 states and 43934 transitions. [2019-12-18 22:02:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:40,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:40,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:40,090 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash 680862979, now seen corresponding path program 8 times [2019-12-18 22:02:40,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:40,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765985336] [2019-12-18 22:02:40,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:40,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765985336] [2019-12-18 22:02:40,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:40,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:02:40,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332718045] [2019-12-18 22:02:40,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:40,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:40,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:40,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:40,394 INFO L87 Difference]: Start difference. First operand 17573 states and 43934 transitions. Second operand 11 states. [2019-12-18 22:02:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:41,815 INFO L93 Difference]: Finished difference Result 21392 states and 52990 transitions. [2019-12-18 22:02:41,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:02:41,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:02:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:41,843 INFO L225 Difference]: With dead ends: 21392 [2019-12-18 22:02:41,843 INFO L226 Difference]: Without dead ends: 21392 [2019-12-18 22:02:41,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:02:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21392 states. [2019-12-18 22:02:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21392 to 17713. [2019-12-18 22:02:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17713 states. [2019-12-18 22:02:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17713 states to 17713 states and 44250 transitions. [2019-12-18 22:02:42,104 INFO L78 Accepts]: Start accepts. Automaton has 17713 states and 44250 transitions. Word has length 97 [2019-12-18 22:02:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:42,105 INFO L462 AbstractCegarLoop]: Abstraction has 17713 states and 44250 transitions. [2019-12-18 22:02:42,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17713 states and 44250 transitions. [2019-12-18 22:02:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:42,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:42,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:42,125 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:42,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1167481557, now seen corresponding path program 9 times [2019-12-18 22:02:42,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:42,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595809856] [2019-12-18 22:02:42,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:43,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595809856] [2019-12-18 22:02:43,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:43,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 22:02:43,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491493963] [2019-12-18 22:02:43,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 22:02:43,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 22:02:43,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:02:43,616 INFO L87 Difference]: Start difference. First operand 17713 states and 44250 transitions. Second operand 24 states. [2019-12-18 22:02:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:49,283 INFO L93 Difference]: Finished difference Result 21161 states and 51714 transitions. [2019-12-18 22:02:49,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 22:02:49,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-18 22:02:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:49,308 INFO L225 Difference]: With dead ends: 21161 [2019-12-18 22:02:49,308 INFO L226 Difference]: Without dead ends: 20374 [2019-12-18 22:02:49,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=392, Invalid=2800, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 22:02:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20374 states. [2019-12-18 22:02:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20374 to 17770. [2019-12-18 22:02:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17770 states. [2019-12-18 22:02:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 44344 transitions. [2019-12-18 22:02:49,564 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 44344 transitions. Word has length 97 [2019-12-18 22:02:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:49,564 INFO L462 AbstractCegarLoop]: Abstraction has 17770 states and 44344 transitions. [2019-12-18 22:02:49,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 22:02:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 44344 transitions. [2019-12-18 22:02:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:49,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:49,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:49,584 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:49,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1324771947, now seen corresponding path program 10 times [2019-12-18 22:02:49,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:49,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628349094] [2019-12-18 22:02:49,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628349094] [2019-12-18 22:02:49,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:49,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:49,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632348586] [2019-12-18 22:02:49,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:49,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:49,735 INFO L87 Difference]: Start difference. First operand 17770 states and 44344 transitions. Second operand 10 states. [2019-12-18 22:02:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:50,563 INFO L93 Difference]: Finished difference Result 18277 states and 45339 transitions. [2019-12-18 22:02:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:02:50,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:02:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:50,586 INFO L225 Difference]: With dead ends: 18277 [2019-12-18 22:02:50,586 INFO L226 Difference]: Without dead ends: 18224 [2019-12-18 22:02:50,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:02:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18224 states. [2019-12-18 22:02:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18224 to 17696. [2019-12-18 22:02:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17696 states. [2019-12-18 22:02:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17696 states to 17696 states and 44177 transitions. [2019-12-18 22:02:50,809 INFO L78 Accepts]: Start accepts. Automaton has 17696 states and 44177 transitions. Word has length 97 [2019-12-18 22:02:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:50,809 INFO L462 AbstractCegarLoop]: Abstraction has 17696 states and 44177 transitions. [2019-12-18 22:02:50,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:02:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17696 states and 44177 transitions. [2019-12-18 22:02:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:50,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:50,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:50,827 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 581708757, now seen corresponding path program 11 times [2019-12-18 22:02:50,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:50,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428526171] [2019-12-18 22:02:50,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:51,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428526171] [2019-12-18 22:02:51,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:51,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:51,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495300984] [2019-12-18 22:02:51,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:51,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:51,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:51,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:51,007 INFO L87 Difference]: Start difference. First operand 17696 states and 44177 transitions. Second operand 11 states. [2019-12-18 22:02:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:52,172 INFO L93 Difference]: Finished difference Result 26360 states and 65362 transitions. [2019-12-18 22:02:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:02:52,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:02:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:52,201 INFO L225 Difference]: With dead ends: 26360 [2019-12-18 22:02:52,201 INFO L226 Difference]: Without dead ends: 25602 [2019-12-18 22:02:52,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:02:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25602 states. [2019-12-18 22:02:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25602 to 23195. [2019-12-18 22:02:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23195 states. [2019-12-18 22:02:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23195 states to 23195 states and 58303 transitions. [2019-12-18 22:02:52,485 INFO L78 Accepts]: Start accepts. Automaton has 23195 states and 58303 transitions. Word has length 97 [2019-12-18 22:02:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:52,485 INFO L462 AbstractCegarLoop]: Abstraction has 23195 states and 58303 transitions. [2019-12-18 22:02:52,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 23195 states and 58303 transitions. [2019-12-18 22:02:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:52,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:52,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:52,509 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1349908595, now seen corresponding path program 12 times [2019-12-18 22:02:52,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:52,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991307921] [2019-12-18 22:02:52,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:52,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991307921] [2019-12-18 22:02:52,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:52,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:02:52,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696383057] [2019-12-18 22:02:52,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:02:52,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:52,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:02:52,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:02:52,841 INFO L87 Difference]: Start difference. First operand 23195 states and 58303 transitions. Second operand 16 states. [2019-12-18 22:02:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:55,778 INFO L93 Difference]: Finished difference Result 29336 states and 73482 transitions. [2019-12-18 22:02:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:02:55,778 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2019-12-18 22:02:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:55,813 INFO L225 Difference]: With dead ends: 29336 [2019-12-18 22:02:55,813 INFO L226 Difference]: Without dead ends: 28965 [2019-12-18 22:02:55,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:02:55,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28965 states. [2019-12-18 22:02:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28965 to 23389. [2019-12-18 22:02:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23389 states. [2019-12-18 22:02:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23389 states to 23389 states and 58891 transitions. [2019-12-18 22:02:56,129 INFO L78 Accepts]: Start accepts. Automaton has 23389 states and 58891 transitions. Word has length 97 [2019-12-18 22:02:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:56,129 INFO L462 AbstractCegarLoop]: Abstraction has 23389 states and 58891 transitions. [2019-12-18 22:02:56,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:02:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 23389 states and 58891 transitions. [2019-12-18 22:02:56,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:56,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:56,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:56,324 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1687903899, now seen corresponding path program 13 times [2019-12-18 22:02:56,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:56,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601195383] [2019-12-18 22:02:56,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:56,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601195383] [2019-12-18 22:02:56,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:56,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:02:56,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972125018] [2019-12-18 22:02:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:02:56,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:02:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:02:56,455 INFO L87 Difference]: Start difference. First operand 23389 states and 58891 transitions. Second operand 9 states. [2019-12-18 22:02:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:56,972 INFO L93 Difference]: Finished difference Result 36076 states and 90492 transitions. [2019-12-18 22:02:56,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:02:56,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 22:02:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:57,014 INFO L225 Difference]: With dead ends: 36076 [2019-12-18 22:02:57,014 INFO L226 Difference]: Without dead ends: 30973 [2019-12-18 22:02:57,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:02:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30973 states. [2019-12-18 22:02:57,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30973 to 25635. [2019-12-18 22:02:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25635 states. [2019-12-18 22:02:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25635 states to 25635 states and 64666 transitions. [2019-12-18 22:02:57,341 INFO L78 Accepts]: Start accepts. Automaton has 25635 states and 64666 transitions. Word has length 97 [2019-12-18 22:02:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:57,341 INFO L462 AbstractCegarLoop]: Abstraction has 25635 states and 64666 transitions. [2019-12-18 22:02:57,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:02:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25635 states and 64666 transitions. [2019-12-18 22:02:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:57,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:57,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:57,366 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1891057497, now seen corresponding path program 14 times [2019-12-18 22:02:57,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:57,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116554623] [2019-12-18 22:02:57,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:57,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116554623] [2019-12-18 22:02:57,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:57,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:02:57,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501340701] [2019-12-18 22:02:57,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:02:57,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:57,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:02:57,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:02:57,547 INFO L87 Difference]: Start difference. First operand 25635 states and 64666 transitions. Second operand 11 states. [2019-12-18 22:02:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:02:58,680 INFO L93 Difference]: Finished difference Result 32284 states and 79761 transitions. [2019-12-18 22:02:58,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:02:58,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:02:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:02:58,719 INFO L225 Difference]: With dead ends: 32284 [2019-12-18 22:02:58,719 INFO L226 Difference]: Without dead ends: 31636 [2019-12-18 22:02:58,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:02:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31636 states. [2019-12-18 22:02:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31636 to 25674. [2019-12-18 22:02:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25674 states. [2019-12-18 22:02:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25674 states to 25674 states and 64725 transitions. [2019-12-18 22:02:59,087 INFO L78 Accepts]: Start accepts. Automaton has 25674 states and 64725 transitions. Word has length 97 [2019-12-18 22:02:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:02:59,087 INFO L462 AbstractCegarLoop]: Abstraction has 25674 states and 64725 transitions. [2019-12-18 22:02:59,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:02:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 25674 states and 64725 transitions. [2019-12-18 22:02:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:02:59,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:02:59,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:02:59,112 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:02:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:02:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2026552579, now seen corresponding path program 15 times [2019-12-18 22:02:59,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:02:59,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548035273] [2019-12-18 22:02:59,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:02:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:02:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:02:59,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548035273] [2019-12-18 22:02:59,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:02:59,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:02:59,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650657097] [2019-12-18 22:02:59,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:02:59,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:02:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:02:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:02:59,261 INFO L87 Difference]: Start difference. First operand 25674 states and 64725 transitions. Second operand 10 states. [2019-12-18 22:03:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:00,321 INFO L93 Difference]: Finished difference Result 43140 states and 107096 transitions. [2019-12-18 22:03:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:03:00,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:03:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:00,369 INFO L225 Difference]: With dead ends: 43140 [2019-12-18 22:03:00,370 INFO L226 Difference]: Without dead ends: 42388 [2019-12-18 22:03:00,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:03:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42388 states. [2019-12-18 22:03:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42388 to 26577. [2019-12-18 22:03:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26577 states. [2019-12-18 22:03:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26577 states to 26577 states and 67084 transitions. [2019-12-18 22:03:00,794 INFO L78 Accepts]: Start accepts. Automaton has 26577 states and 67084 transitions. Word has length 97 [2019-12-18 22:03:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:00,794 INFO L462 AbstractCegarLoop]: Abstraction has 26577 states and 67084 transitions. [2019-12-18 22:03:00,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:03:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26577 states and 67084 transitions. [2019-12-18 22:03:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:00,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:00,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:00,822 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:00,822 INFO L82 PathProgramCache]: Analyzing trace with hash -701982735, now seen corresponding path program 16 times [2019-12-18 22:03:00,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:00,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121702018] [2019-12-18 22:03:00,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:01,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121702018] [2019-12-18 22:03:01,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:01,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-18 22:03:01,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247809991] [2019-12-18 22:03:01,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 22:03:01,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:01,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 22:03:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-12-18 22:03:01,850 INFO L87 Difference]: Start difference. First operand 26577 states and 67084 transitions. Second operand 26 states. [2019-12-18 22:03:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:13,827 INFO L93 Difference]: Finished difference Result 50226 states and 125977 transitions. [2019-12-18 22:03:13,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-12-18 22:03:13,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2019-12-18 22:03:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:13,927 INFO L225 Difference]: With dead ends: 50226 [2019-12-18 22:03:13,927 INFO L226 Difference]: Without dead ends: 49865 [2019-12-18 22:03:13,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2776 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=864, Invalid=8448, Unknown=0, NotChecked=0, Total=9312 [2019-12-18 22:03:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49865 states. [2019-12-18 22:03:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49865 to 32088. [2019-12-18 22:03:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32088 states. [2019-12-18 22:03:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32088 states to 32088 states and 81362 transitions. [2019-12-18 22:03:14,617 INFO L78 Accepts]: Start accepts. Automaton has 32088 states and 81362 transitions. Word has length 97 [2019-12-18 22:03:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:14,617 INFO L462 AbstractCegarLoop]: Abstraction has 32088 states and 81362 transitions. [2019-12-18 22:03:14,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-18 22:03:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32088 states and 81362 transitions. [2019-12-18 22:03:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:14,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:14,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:14,652 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:14,652 INFO L82 PathProgramCache]: Analyzing trace with hash 984025321, now seen corresponding path program 17 times [2019-12-18 22:03:14,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:14,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24430067] [2019-12-18 22:03:14,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:14,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24430067] [2019-12-18 22:03:14,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:14,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:03:14,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576895012] [2019-12-18 22:03:14,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:03:14,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:14,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:03:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:03:14,795 INFO L87 Difference]: Start difference. First operand 32088 states and 81362 transitions. Second operand 6 states. [2019-12-18 22:03:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:15,111 INFO L93 Difference]: Finished difference Result 32973 states and 83283 transitions. [2019-12-18 22:03:15,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 22:03:15,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 22:03:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:15,156 INFO L225 Difference]: With dead ends: 32973 [2019-12-18 22:03:15,157 INFO L226 Difference]: Without dead ends: 32973 [2019-12-18 22:03:15,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:03:15,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32973 states. [2019-12-18 22:03:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32973 to 32012. [2019-12-18 22:03:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32012 states. [2019-12-18 22:03:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32012 states to 32012 states and 81117 transitions. [2019-12-18 22:03:15,597 INFO L78 Accepts]: Start accepts. Automaton has 32012 states and 81117 transitions. Word has length 97 [2019-12-18 22:03:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:15,597 INFO L462 AbstractCegarLoop]: Abstraction has 32012 states and 81117 transitions. [2019-12-18 22:03:15,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:03:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 32012 states and 81117 transitions. [2019-12-18 22:03:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:15,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:15,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:15,634 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1254988047, now seen corresponding path program 18 times [2019-12-18 22:03:15,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:15,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676856262] [2019-12-18 22:03:15,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:15,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676856262] [2019-12-18 22:03:15,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:15,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:03:15,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810012516] [2019-12-18 22:03:15,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:03:15,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:15,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:03:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:03:15,797 INFO L87 Difference]: Start difference. First operand 32012 states and 81117 transitions. Second operand 9 states. [2019-12-18 22:03:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:16,766 INFO L93 Difference]: Finished difference Result 42009 states and 106439 transitions. [2019-12-18 22:03:16,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:03:16,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 22:03:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:16,817 INFO L225 Difference]: With dead ends: 42009 [2019-12-18 22:03:16,817 INFO L226 Difference]: Without dead ends: 41976 [2019-12-18 22:03:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:03:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41976 states. [2019-12-18 22:03:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41976 to 34503. [2019-12-18 22:03:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34503 states. [2019-12-18 22:03:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 87395 transitions. [2019-12-18 22:03:17,426 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 87395 transitions. Word has length 97 [2019-12-18 22:03:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:17,426 INFO L462 AbstractCegarLoop]: Abstraction has 34503 states and 87395 transitions. [2019-12-18 22:03:17,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:03:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 87395 transitions. [2019-12-18 22:03:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:17,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:17,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:17,462 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 699912021, now seen corresponding path program 19 times [2019-12-18 22:03:17,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:17,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96145762] [2019-12-18 22:03:17,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:17,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96145762] [2019-12-18 22:03:17,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:17,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:03:17,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777180447] [2019-12-18 22:03:17,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:03:17,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:03:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:03:17,662 INFO L87 Difference]: Start difference. First operand 34503 states and 87395 transitions. Second operand 10 states. [2019-12-18 22:03:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:19,139 INFO L93 Difference]: Finished difference Result 46942 states and 118285 transitions. [2019-12-18 22:03:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:03:19,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:03:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:19,194 INFO L225 Difference]: With dead ends: 46942 [2019-12-18 22:03:19,194 INFO L226 Difference]: Without dead ends: 46897 [2019-12-18 22:03:19,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:03:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46897 states. [2019-12-18 22:03:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46897 to 31003. [2019-12-18 22:03:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31003 states. [2019-12-18 22:03:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 78278 transitions. [2019-12-18 22:03:19,642 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 78278 transitions. Word has length 97 [2019-12-18 22:03:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:19,642 INFO L462 AbstractCegarLoop]: Abstraction has 31003 states and 78278 transitions. [2019-12-18 22:03:19,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:03:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 78278 transitions. [2019-12-18 22:03:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:19,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:19,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:19,672 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1027543411, now seen corresponding path program 20 times [2019-12-18 22:03:19,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:19,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490039475] [2019-12-18 22:03:19,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:19,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490039475] [2019-12-18 22:03:19,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:19,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:03:19,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704220754] [2019-12-18 22:03:19,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:03:19,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:03:19,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:03:19,827 INFO L87 Difference]: Start difference. First operand 31003 states and 78278 transitions. Second operand 9 states. [2019-12-18 22:03:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:21,067 INFO L93 Difference]: Finished difference Result 39968 states and 100347 transitions. [2019-12-18 22:03:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:03:21,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 22:03:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:21,113 INFO L225 Difference]: With dead ends: 39968 [2019-12-18 22:03:21,113 INFO L226 Difference]: Without dead ends: 39935 [2019-12-18 22:03:21,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:03:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39935 states. [2019-12-18 22:03:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39935 to 30754. [2019-12-18 22:03:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30754 states. [2019-12-18 22:03:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30754 states to 30754 states and 77023 transitions. [2019-12-18 22:03:21,530 INFO L78 Accepts]: Start accepts. Automaton has 30754 states and 77023 transitions. Word has length 97 [2019-12-18 22:03:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:21,530 INFO L462 AbstractCegarLoop]: Abstraction has 30754 states and 77023 transitions. [2019-12-18 22:03:21,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:03:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30754 states and 77023 transitions. [2019-12-18 22:03:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:21,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:21,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:21,567 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash 927356657, now seen corresponding path program 21 times [2019-12-18 22:03:21,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:21,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077791968] [2019-12-18 22:03:21,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:21,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077791968] [2019-12-18 22:03:21,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:21,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:03:21,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690979724] [2019-12-18 22:03:21,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:03:21,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:21,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:03:21,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:03:21,725 INFO L87 Difference]: Start difference. First operand 30754 states and 77023 transitions. Second operand 10 states. [2019-12-18 22:03:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:23,532 INFO L93 Difference]: Finished difference Result 43647 states and 108866 transitions. [2019-12-18 22:03:23,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:03:23,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:03:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:23,583 INFO L225 Difference]: With dead ends: 43647 [2019-12-18 22:03:23,583 INFO L226 Difference]: Without dead ends: 43602 [2019-12-18 22:03:23,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:03:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43602 states. [2019-12-18 22:03:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43602 to 27276. [2019-12-18 22:03:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27276 states. [2019-12-18 22:03:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27276 states to 27276 states and 67933 transitions. [2019-12-18 22:03:24,010 INFO L78 Accepts]: Start accepts. Automaton has 27276 states and 67933 transitions. Word has length 97 [2019-12-18 22:03:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:24,010 INFO L462 AbstractCegarLoop]: Abstraction has 27276 states and 67933 transitions. [2019-12-18 22:03:24,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:03:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 27276 states and 67933 transitions. [2019-12-18 22:03:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:24,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:24,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:24,037 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1814887201, now seen corresponding path program 22 times [2019-12-18 22:03:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:24,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76055754] [2019-12-18 22:03:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:24,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76055754] [2019-12-18 22:03:24,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:24,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:03:24,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411875869] [2019-12-18 22:03:24,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:03:24,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:24,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:03:24,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:03:24,182 INFO L87 Difference]: Start difference. First operand 27276 states and 67933 transitions. Second operand 9 states. [2019-12-18 22:03:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:25,322 INFO L93 Difference]: Finished difference Result 39031 states and 97921 transitions. [2019-12-18 22:03:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 22:03:25,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 22:03:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:25,367 INFO L225 Difference]: With dead ends: 39031 [2019-12-18 22:03:25,368 INFO L226 Difference]: Without dead ends: 39031 [2019-12-18 22:03:25,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:03:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39031 states. [2019-12-18 22:03:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39031 to 28380. [2019-12-18 22:03:25,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28380 states. [2019-12-18 22:03:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28380 states to 28380 states and 70707 transitions. [2019-12-18 22:03:25,812 INFO L78 Accepts]: Start accepts. Automaton has 28380 states and 70707 transitions. Word has length 97 [2019-12-18 22:03:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:25,812 INFO L462 AbstractCegarLoop]: Abstraction has 28380 states and 70707 transitions. [2019-12-18 22:03:25,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:03:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 28380 states and 70707 transitions. [2019-12-18 22:03:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:25,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:25,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:25,842 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash 140012867, now seen corresponding path program 23 times [2019-12-18 22:03:25,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:25,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962605784] [2019-12-18 22:03:25,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:26,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962605784] [2019-12-18 22:03:26,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:26,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:03:26,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203621841] [2019-12-18 22:03:26,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:03:26,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:03:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:03:26,011 INFO L87 Difference]: Start difference. First operand 28380 states and 70707 transitions. Second operand 11 states. [2019-12-18 22:03:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:27,481 INFO L93 Difference]: Finished difference Result 38190 states and 95096 transitions. [2019-12-18 22:03:27,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:03:27,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 22:03:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:27,530 INFO L225 Difference]: With dead ends: 38190 [2019-12-18 22:03:27,530 INFO L226 Difference]: Without dead ends: 38190 [2019-12-18 22:03:27,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-18 22:03:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38190 states. [2019-12-18 22:03:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38190 to 27353. [2019-12-18 22:03:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27353 states. [2019-12-18 22:03:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27353 states to 27353 states and 68107 transitions. [2019-12-18 22:03:27,955 INFO L78 Accepts]: Start accepts. Automaton has 27353 states and 68107 transitions. Word has length 97 [2019-12-18 22:03:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:27,955 INFO L462 AbstractCegarLoop]: Abstraction has 27353 states and 68107 transitions. [2019-12-18 22:03:27,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:03:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 27353 states and 68107 transitions. [2019-12-18 22:03:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:03:27,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:27,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:27,983 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 753506757, now seen corresponding path program 24 times [2019-12-18 22:03:27,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:27,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814050386] [2019-12-18 22:03:27,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:28,315 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2019-12-18 22:03:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:28,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814050386] [2019-12-18 22:03:28,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:28,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 22:03:28,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367552055] [2019-12-18 22:03:28,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 22:03:28,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 22:03:28,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:03:28,835 INFO L87 Difference]: Start difference. First operand 27353 states and 68107 transitions. Second operand 20 states. [2019-12-18 22:03:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:36,238 INFO L93 Difference]: Finished difference Result 43073 states and 107719 transitions. [2019-12-18 22:03:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 22:03:36,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-18 22:03:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:36,290 INFO L225 Difference]: With dead ends: 43073 [2019-12-18 22:03:36,290 INFO L226 Difference]: Without dead ends: 40821 [2019-12-18 22:03:36,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=350, Invalid=2620, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 22:03:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40821 states. [2019-12-18 22:03:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40821 to 33547. [2019-12-18 22:03:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33547 states. [2019-12-18 22:03:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33547 states to 33547 states and 84548 transitions. [2019-12-18 22:03:36,905 INFO L78 Accepts]: Start accepts. Automaton has 33547 states and 84548 transitions. Word has length 97 [2019-12-18 22:03:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:36,905 INFO L462 AbstractCegarLoop]: Abstraction has 33547 states and 84548 transitions. [2019-12-18 22:03:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 22:03:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33547 states and 84548 transitions. [2019-12-18 22:03:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:03:36,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:36,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:36,944 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash 362203226, now seen corresponding path program 1 times [2019-12-18 22:03:36,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:36,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093803113] [2019-12-18 22:03:36,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:37,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093803113] [2019-12-18 22:03:37,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:37,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 22:03:37,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249426836] [2019-12-18 22:03:37,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 22:03:37,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:37,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 22:03:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-18 22:03:37,582 INFO L87 Difference]: Start difference. First operand 33547 states and 84548 transitions. Second operand 19 states. Received shutdown request... [2019-12-18 22:03:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 22:03:41,463 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 22:03:41,466 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 22:03:41,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:41 BasicIcfg [2019-12-18 22:03:41,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:41,468 INFO L168 Benchmark]: Toolchain (without parser) took 208887.89 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 22:03:41,468 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:03:41,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.65 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 154.3 MB in the end (delta: -53.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:41,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 150.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:41,469 INFO L168 Benchmark]: Boogie Preprocessor took 49.41 ms. Allocated memory is still 203.4 MB. Free memory was 150.5 MB in the beginning and 147.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:41,470 INFO L168 Benchmark]: RCFGBuilder took 1292.60 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 147.7 MB in the beginning and 190.3 MB in the end (delta: -42.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:41,470 INFO L168 Benchmark]: TraceAbstraction took 206651.10 ms. Allocated memory was 235.9 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 190.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 22:03:41,473 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.65 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.0 MB in the beginning and 154.3 MB in the end (delta: -53.3 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.98 ms. Allocated memory is still 203.4 MB. Free memory was 154.3 MB in the beginning and 150.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.41 ms. Allocated memory is still 203.4 MB. Free memory was 150.5 MB in the beginning and 147.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1292.60 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 147.7 MB in the beginning and 190.3 MB in the end (delta: -42.5 MB). Peak memory consumption was 64.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206651.10 ms. Allocated memory was 235.9 MB in the beginning and 2.8 GB in the end (delta: 2.5 GB). Free memory was 190.3 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (33547states) and FLOYD_HOARE automaton (currently 55 states, 19 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (33547states) and FLOYD_HOARE automaton (currently 55 states, 19 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 65 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 206.4s, OverallIterations: 50, TraceHistogramMax: 1, AutomataDifference: 109.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20923 SDtfs, 27042 SDslu, 95499 SDs, 0 SdLazy, 60926 SolverSat, 1470 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1053 GetRequests, 145 SyntacticMatches, 108 SemanticMatches, 799 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6731 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243454occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 64.5s AutomataMinimizationTime, 49 MinimizatonAttempts, 295493 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 4113 NumberOfCodeBlocks, 4113 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 4063 ConstructedInterpolants, 0 QuantifiedInterpolants, 1551608 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown