/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:56:07,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:56:07,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:56:07,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:56:07,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:56:07,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:56:07,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:56:07,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:56:07,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:56:07,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:56:07,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:56:07,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:56:07,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:56:07,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:56:07,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:56:07,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:56:07,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:56:07,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:56:07,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:56:07,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:56:07,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:56:07,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:56:07,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:56:07,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:56:07,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:56:07,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:56:07,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:56:07,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:56:07,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:56:07,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:56:07,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:56:07,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:56:07,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:56:07,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:56:07,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:56:07,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:56:07,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:56:07,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:56:07,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:56:07,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:56:07,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:56:07,094 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-SemanticLbe.epf [2019-12-27 01:56:07,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:56:07,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:56:07,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:56:07,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:56:07,134 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:56:07,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:56:07,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:56:07,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:56:07,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:56:07,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:56:07,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:56:07,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:56:07,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:56:07,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:56:07,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:56:07,137 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:56:07,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:56:07,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:56:07,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:56:07,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:56:07,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:56:07,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:56:07,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:56:07,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:56:07,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:56:07,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:56:07,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:56:07,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:56:07,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:56:07,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:56:07,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:56:07,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:56:07,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:56:07,475 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:56:07,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-27 01:56:07,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bab5abe/b639d245ea354f9e9d7fe4b9095e7603/FLAGd1efad22d [2019-12-27 01:56:08,045 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:56:08,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.oepc.i [2019-12-27 01:56:08,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bab5abe/b639d245ea354f9e9d7fe4b9095e7603/FLAGd1efad22d [2019-12-27 01:56:08,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63bab5abe/b639d245ea354f9e9d7fe4b9095e7603 [2019-12-27 01:56:08,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:56:08,344 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:56:08,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:56:08,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:56:08,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:56:08,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:56:08" (1/1) ... [2019-12-27 01:56:08,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc701e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:08, skipping insertion in model container [2019-12-27 01:56:08,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:56:08" (1/1) ... [2019-12-27 01:56:08,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:56:08,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:56:08,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:56:08,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:56:09,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:56:09,128 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:56:09,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09 WrapperNode [2019-12-27 01:56:09,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:56:09,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:56:09,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:56:09,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:56:09,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:56:09,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:56:09,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:56:09,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:56:09,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (1/1) ... [2019-12-27 01:56:09,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:56:09,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:56:09,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:56:09,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:56:09,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (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-27 01:56:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:56:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:56:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:56:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:56:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:56:09,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:56:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:56:09,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:56:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:56:09,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:56:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:56:09,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:56:09,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:56:09,306 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:56:10,062 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:56:10,062 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:56:10,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:56:10 BoogieIcfgContainer [2019-12-27 01:56:10,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:56:10,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:56:10,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:56:10,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:56:10,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:56:08" (1/3) ... [2019-12-27 01:56:10,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ee07e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:56:10, skipping insertion in model container [2019-12-27 01:56:10,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:56:09" (2/3) ... [2019-12-27 01:56:10,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ee07e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:56:10, skipping insertion in model container [2019-12-27 01:56:10,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:56:10" (3/3) ... [2019-12-27 01:56:10,073 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_pso.oepc.i [2019-12-27 01:56:10,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:56:10,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:56:10,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:56:10,096 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:56:10,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,143 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,144 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,146 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,174 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,174 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,191 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,192 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,195 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,209 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,211 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,225 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,225 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:56:10,244 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:56:10,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:56:10,265 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:56:10,265 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:56:10,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:56:10,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:56:10,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:56:10,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:56:10,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:56:10,283 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 01:56:10,284 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:56:10,386 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:56:10,387 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:56:10,403 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:56:10,436 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 01:56:10,490 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 01:56:10,490 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:56:10,501 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:56:10,528 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:56:10,529 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:56:15,645 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 01:56:15,774 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 01:56:16,035 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-27 01:56:16,036 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 01:56:16,042 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-27 01:56:37,454 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-27 01:56:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-27 01:56:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:56:37,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:37,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:56:37,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-27 01:56:37,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:37,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383505756] [2019-12-27 01:56:37,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:37,727 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-27 01:56:37,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383505756] [2019-12-27 01:56:37,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:37,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:56:37,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391693268] [2019-12-27 01:56:37,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:56:37,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:37,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:56:37,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:56:37,749 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-27 01:56:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:41,160 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-27 01:56:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:56:41,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:56:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:42,032 INFO L225 Difference]: With dead ends: 121140 [2019-12-27 01:56:42,033 INFO L226 Difference]: Without dead ends: 107958 [2019-12-27 01:56:42,036 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-27 01:56:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-27 01:56:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-27 01:56:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-27 01:56:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-27 01:56:51,396 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-27 01:56:51,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:56:51,396 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-27 01:56:51,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:56:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-27 01:56:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:56:51,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:56:51,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:56:51,402 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:56:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:56:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-27 01:56:51,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:56:51,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656645917] [2019-12-27 01:56:51,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:56:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:56:51,492 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-27 01:56:51,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656645917] [2019-12-27 01:56:51,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:56:51,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:56:51,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660029524] [2019-12-27 01:56:51,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:56:51,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:56:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:56:51,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:56:51,496 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-27 01:56:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:56:56,333 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-27 01:56:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:56:56,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:56:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:56:56,921 INFO L225 Difference]: With dead ends: 172022 [2019-12-27 01:56:56,921 INFO L226 Difference]: Without dead ends: 171924 [2019-12-27 01:56:56,922 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-27 01:57:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-27 01:57:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-27 01:57:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-27 01:57:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-27 01:57:13,992 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-27 01:57:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:13,993 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-27 01:57:13,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-27 01:57:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:57:14,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:14,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:14,000 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:14,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-27 01:57:14,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:14,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427433528] [2019-12-27 01:57:14,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:14,073 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-27 01:57:14,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427433528] [2019-12-27 01:57:14,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:14,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:14,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875148564] [2019-12-27 01:57:14,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:14,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:14,077 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-27 01:57:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:14,215 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-27 01:57:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:14,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:57:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:14,312 INFO L225 Difference]: With dead ends: 33388 [2019-12-27 01:57:14,312 INFO L226 Difference]: Without dead ends: 33388 [2019-12-27 01:57:14,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 01:57:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-27 01:57:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-27 01:57:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-27 01:57:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-27 01:57:15,030 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-27 01:57:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:15,030 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-27 01:57:15,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-27 01:57:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:57:15,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:15,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:15,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-27 01:57:15,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:15,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483724323] [2019-12-27 01:57:15,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:15,098 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-27 01:57:15,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483724323] [2019-12-27 01:57:15,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:15,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:15,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840881314] [2019-12-27 01:57:15,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:15,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:15,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:15,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:15,100 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-27 01:57:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:15,297 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-27 01:57:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:15,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 01:57:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:15,414 INFO L225 Difference]: With dead ends: 52822 [2019-12-27 01:57:15,415 INFO L226 Difference]: Without dead ends: 52822 [2019-12-27 01:57:15,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-27 01:57:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-27 01:57:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-27 01:57:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-27 01:57:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-27 01:57:19,197 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-27 01:57:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:19,198 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-27 01:57:19,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-27 01:57:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:57:19,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:19,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:19,203 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-27 01:57:19,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:19,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786058770] [2019-12-27 01:57:19,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:19,286 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-27 01:57:19,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786058770] [2019-12-27 01:57:19,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:19,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:19,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007330564] [2019-12-27 01:57:19,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:19,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:19,289 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-27 01:57:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:19,638 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-27 01:57:19,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:57:19,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:57:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:19,719 INFO L225 Difference]: With dead ends: 46903 [2019-12-27 01:57:19,719 INFO L226 Difference]: Without dead ends: 46903 [2019-12-27 01:57:19,719 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-27 01:57:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-27 01:57:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-27 01:57:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 01:57:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-27 01:57:20,509 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-27 01:57:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:20,509 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-27 01:57:20,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-27 01:57:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:57:20,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:20,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:57:20,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-27 01:57:20,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:20,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869069746] [2019-12-27 01:57:20,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:20,579 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-27 01:57:20,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869069746] [2019-12-27 01:57:20,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:20,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:20,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068646731] [2019-12-27 01:57:20,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:20,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:20,581 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-27 01:57:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:21,321 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-27 01:57:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:57:21,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 01:57:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:21,422 INFO L225 Difference]: With dead ends: 51478 [2019-12-27 01:57:21,422 INFO L226 Difference]: Without dead ends: 51478 [2019-12-27 01:57:21,422 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-27 01:57:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-27 01:57:22,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-27 01:57:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-27 01:57:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-27 01:57:22,283 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-27 01:57:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:22,284 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-27 01:57:22,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-27 01:57:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:57:22,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:22,293 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] [2019-12-27 01:57:22,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-27 01:57:22,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:22,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076513293] [2019-12-27 01:57:22,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:22,374 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-27 01:57:22,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076513293] [2019-12-27 01:57:22,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:22,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:22,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142779056] [2019-12-27 01:57:22,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:22,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:22,377 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-27 01:57:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:23,038 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-27 01:57:23,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:57:23,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:57:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:23,146 INFO L225 Difference]: With dead ends: 61264 [2019-12-27 01:57:23,146 INFO L226 Difference]: Without dead ends: 61250 [2019-12-27 01:57:23,147 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-27 01:57:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-27 01:57:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-27 01:57:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-27 01:57:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-27 01:57:24,484 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-27 01:57:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:24,484 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-27 01:57:24,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-27 01:57:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:57:24,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:24,495 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] [2019-12-27 01:57:24,495 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:24,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-27 01:57:24,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:24,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158106307] [2019-12-27 01:57:24,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:24,561 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-27 01:57:24,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158106307] [2019-12-27 01:57:24,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:24,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:24,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008821819] [2019-12-27 01:57:24,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:24,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:24,564 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-27 01:57:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:25,190 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-27 01:57:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:57:25,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:57:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:25,302 INFO L225 Difference]: With dead ends: 63752 [2019-12-27 01:57:25,302 INFO L226 Difference]: Without dead ends: 63738 [2019-12-27 01:57:25,303 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-27 01:57:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-27 01:57:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-27 01:57:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-27 01:57:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-27 01:57:26,690 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-27 01:57:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:26,691 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-27 01:57:26,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-27 01:57:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:57:26,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:26,703 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-27 01:57:26,703 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-27 01:57:26,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:26,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383901317] [2019-12-27 01:57:26,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:26,746 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-27 01:57:26,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383901317] [2019-12-27 01:57:26,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:26,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:26,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261220293] [2019-12-27 01:57:26,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:57:26,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:26,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:57:26,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:26,748 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-27 01:57:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:26,839 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-27 01:57:26,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:57:26,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:57:26,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:26,873 INFO L225 Difference]: With dead ends: 17193 [2019-12-27 01:57:26,873 INFO L226 Difference]: Without dead ends: 17193 [2019-12-27 01:57:26,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:57:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-27 01:57:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-27 01:57:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-27 01:57:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-27 01:57:27,147 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-27 01:57:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:27,147 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-27 01:57:27,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:57:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-27 01:57:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 01:57:27,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:27,160 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] [2019-12-27 01:57:27,160 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-27 01:57:27,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:27,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624923358] [2019-12-27 01:57:27,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:27,217 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-27 01:57:27,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624923358] [2019-12-27 01:57:27,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:27,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:27,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552671287] [2019-12-27 01:57:27,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:27,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:27,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:27,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:27,219 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-27 01:57:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:27,534 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-27 01:57:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:57:27,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 01:57:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:27,566 INFO L225 Difference]: With dead ends: 21613 [2019-12-27 01:57:27,566 INFO L226 Difference]: Without dead ends: 21613 [2019-12-27 01:57:27,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-27 01:57:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-27 01:57:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-27 01:57:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-27 01:57:27,877 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-27 01:57:27,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:27,877 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-27 01:57:27,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-27 01:57:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 01:57:27,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:27,892 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] [2019-12-27 01:57:27,892 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-27 01:57:27,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:27,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135656646] [2019-12-27 01:57:27,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:27,958 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-27 01:57:27,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135656646] [2019-12-27 01:57:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:57:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710788711] [2019-12-27 01:57:27,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:27,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:27,961 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-27 01:57:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:28,386 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-27 01:57:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:57:28,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 01:57:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:28,442 INFO L225 Difference]: With dead ends: 23624 [2019-12-27 01:57:28,442 INFO L226 Difference]: Without dead ends: 23624 [2019-12-27 01:57:28,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-27 01:57:29,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-27 01:57:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-27 01:57:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-27 01:57:29,157 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-27 01:57:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:29,158 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-27 01:57:29,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-27 01:57:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 01:57:29,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:29,178 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] [2019-12-27 01:57:29,178 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-27 01:57:29,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:29,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028661013] [2019-12-27 01:57:29,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:29,296 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-27 01:57:29,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028661013] [2019-12-27 01:57:29,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:29,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:57:29,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502328393] [2019-12-27 01:57:29,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:29,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:29,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:29,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:29,298 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-27 01:57:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:29,990 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-27 01:57:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:29,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 01:57:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:30,047 INFO L225 Difference]: With dead ends: 27031 [2019-12-27 01:57:30,047 INFO L226 Difference]: Without dead ends: 27031 [2019-12-27 01:57:30,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:57:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-27 01:57:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-27 01:57:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-27 01:57:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-27 01:57:30,390 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-27 01:57:30,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:30,390 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-27 01:57:30,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-27 01:57:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 01:57:30,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:30,413 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] [2019-12-27 01:57:30,413 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-27 01:57:30,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:30,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342029132] [2019-12-27 01:57:30,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57: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-27 01:57:30,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342029132] [2019-12-27 01:57:30,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:30,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:57:30,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362792802] [2019-12-27 01:57:30,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:57:30,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:57:30,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:57:30,498 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-27 01:57:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:31,139 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-27 01:57:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:31,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 01:57:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:31,179 INFO L225 Difference]: With dead ends: 26334 [2019-12-27 01:57:31,179 INFO L226 Difference]: Without dead ends: 26334 [2019-12-27 01:57:31,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:57:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-27 01:57:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-27 01:57:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-27 01:57:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-27 01:57:31,504 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-27 01:57:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:31,504 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-27 01:57:31,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:57:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-27 01:57:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:57:31,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:31,521 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] [2019-12-27 01:57:31,521 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-27 01:57:31,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:31,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515806752] [2019-12-27 01:57:31,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:31,581 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-27 01:57:31,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515806752] [2019-12-27 01:57:31,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:31,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:57:31,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665345636] [2019-12-27 01:57:31,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:31,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:31,583 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-27 01:57:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:31,655 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-27 01:57:31,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:31,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:57:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:31,691 INFO L225 Difference]: With dead ends: 17641 [2019-12-27 01:57:31,691 INFO L226 Difference]: Without dead ends: 17641 [2019-12-27 01:57:31,692 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-27 01:57:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-27 01:57:31,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-27 01:57:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-27 01:57:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-27 01:57:32,293 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-27 01:57:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:32,294 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-27 01:57:32,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-27 01:57:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:57:32,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:32,313 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] [2019-12-27 01:57:32,314 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-27 01:57:32,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:32,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296249572] [2019-12-27 01:57:32,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:32,392 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-27 01:57:32,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296249572] [2019-12-27 01:57:32,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:32,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:57:32,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113554776] [2019-12-27 01:57:32,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:32,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:32,394 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-27 01:57:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:33,045 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-27 01:57:33,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:57:33,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:57:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:33,099 INFO L225 Difference]: With dead ends: 25346 [2019-12-27 01:57:33,099 INFO L226 Difference]: Without dead ends: 25346 [2019-12-27 01:57:33,101 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-27 01:57:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-27 01:57:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-27 01:57:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-27 01:57:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-27 01:57:33,505 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-27 01:57:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:33,506 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-27 01:57:33,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-27 01:57:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:57:33,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:33,535 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] [2019-12-27 01:57:33,535 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-27 01:57:33,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:33,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178671062] [2019-12-27 01:57:33,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:33,596 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-27 01:57:33,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178671062] [2019-12-27 01:57:33,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:33,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:57:33,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803480187] [2019-12-27 01:57:33,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:57:33,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:33,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:57:33,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:33,599 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-27 01:57:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:33,707 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-27 01:57:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:57:33,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:57:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:33,748 INFO L225 Difference]: With dead ends: 22175 [2019-12-27 01:57:33,748 INFO L226 Difference]: Without dead ends: 22175 [2019-12-27 01:57:33,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:57:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-27 01:57:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-27 01:57:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-27 01:57:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-27 01:57:34,101 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-27 01:57:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:34,101 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-27 01:57:34,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:57:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-27 01:57:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:34,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:34,135 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] [2019-12-27 01:57:34,135 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:34,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-27 01:57:34,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:34,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584318555] [2019-12-27 01:57:34,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:34,226 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-27 01:57:34,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584318555] [2019-12-27 01:57:34,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:34,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:34,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546516510] [2019-12-27 01:57:34,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:34,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:34,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:34,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:34,228 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-27 01:57:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:34,814 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-27 01:57:34,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:57:34,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:34,890 INFO L225 Difference]: With dead ends: 62478 [2019-12-27 01:57:34,891 INFO L226 Difference]: Without dead ends: 47634 [2019-12-27 01:57:34,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:57:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-27 01:57:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-27 01:57:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-27 01:57:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-27 01:57:35,814 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-27 01:57:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:35,814 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-27 01:57:35,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-27 01:57:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:35,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:35,844 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] [2019-12-27 01:57:35,845 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-27 01:57:35,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:35,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474474645] [2019-12-27 01:57:35,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:35,941 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-27 01:57:35,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474474645] [2019-12-27 01:57:35,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:35,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:35,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326743135] [2019-12-27 01:57:35,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:35,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:35,943 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-27 01:57:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:36,644 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-27 01:57:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:57:36,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:36,724 INFO L225 Difference]: With dead ends: 68433 [2019-12-27 01:57:36,724 INFO L226 Difference]: Without dead ends: 48478 [2019-12-27 01:57:36,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:57:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-27 01:57:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-27 01:57:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-27 01:57:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-27 01:57:37,371 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-27 01:57:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:37,371 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-27 01:57:37,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-27 01:57:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:37,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:37,406 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] [2019-12-27 01:57:37,406 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-27 01:57:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065834400] [2019-12-27 01:57:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:37,483 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-27 01:57:37,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065834400] [2019-12-27 01:57:37,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:37,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:57:37,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686206711] [2019-12-27 01:57:37,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:57:37,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:57:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:57:37,485 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-27 01:57:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:37,999 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-27 01:57:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 01:57:38,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-27 01:57:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:38,081 INFO L225 Difference]: With dead ends: 59843 [2019-12-27 01:57:38,082 INFO L226 Difference]: Without dead ends: 52762 [2019-12-27 01:57:38,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:57:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-27 01:57:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-27 01:57:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-27 01:57:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-27 01:57:39,097 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-27 01:57:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:39,097 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-27 01:57:39,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:57:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-27 01:57:39,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 01:57:39,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:39,130 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] [2019-12-27 01:57:39,130 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:39,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-27 01:57:39,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:39,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838263747] [2019-12-27 01:57:39,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:39,184 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-27 01:57:39,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838263747] [2019-12-27 01:57:39,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:39,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:39,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72843787] [2019-12-27 01:57:39,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:39,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:39,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:39,186 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-27 01:57:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:39,367 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-27 01:57:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:39,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 01:57:39,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:39,421 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 01:57:39,421 INFO L226 Difference]: Without dead ends: 35624 [2019-12-27 01:57:39,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 01:57:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-27 01:57:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-27 01:57:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-27 01:57:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-27 01:57:39,938 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-27 01:57:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:39,938 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-27 01:57:39,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-27 01:57:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:57:39,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:39,973 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-27 01:57:39,973 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-27 01:57:39,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:39,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821588852] [2019-12-27 01:57:39,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:40,029 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-27 01:57:40,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821588852] [2019-12-27 01:57:40,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:40,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:40,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740136480] [2019-12-27 01:57:40,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:40,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:40,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:40,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:40,031 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 3 states. [2019-12-27 01:57:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:40,172 INFO L93 Difference]: Finished difference Result 31021 states and 96382 transitions. [2019-12-27 01:57:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:40,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:57:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:40,235 INFO L225 Difference]: With dead ends: 31021 [2019-12-27 01:57:40,235 INFO L226 Difference]: Without dead ends: 31021 [2019-12-27 01:57:40,237 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-27 01:57:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31021 states. [2019-12-27 01:57:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31021 to 27348. [2019-12-27 01:57:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 01:57:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 86085 transitions. [2019-12-27 01:57:40,930 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 86085 transitions. Word has length 64 [2019-12-27 01:57:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:40,931 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 86085 transitions. [2019-12-27 01:57:40,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 86085 transitions. [2019-12-27 01:57:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:57:40,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:40,972 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] [2019-12-27 01:57:40,972 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:40,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-27 01:57:40,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:40,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760795325] [2019-12-27 01:57:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:41,090 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-27 01:57:41,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760795325] [2019-12-27 01:57:41,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:41,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:57:41,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380219610] [2019-12-27 01:57:41,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:57:41,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:41,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:57:41,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:57:41,093 INFO L87 Difference]: Start difference. First operand 27348 states and 86085 transitions. Second operand 3 states. [2019-12-27 01:57:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:41,442 INFO L93 Difference]: Finished difference Result 23805 states and 73809 transitions. [2019-12-27 01:57:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:57:41,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:57:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:41,477 INFO L225 Difference]: With dead ends: 23805 [2019-12-27 01:57:41,477 INFO L226 Difference]: Without dead ends: 23805 [2019-12-27 01:57:41,478 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-27 01:57:41,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23805 states. [2019-12-27 01:57:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23805 to 21779. [2019-12-27 01:57:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21779 states. [2019-12-27 01:57:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21779 states to 21779 states and 67477 transitions. [2019-12-27 01:57:41,810 INFO L78 Accepts]: Start accepts. Automaton has 21779 states and 67477 transitions. Word has length 65 [2019-12-27 01:57:41,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:41,810 INFO L462 AbstractCegarLoop]: Abstraction has 21779 states and 67477 transitions. [2019-12-27 01:57:41,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:57:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 21779 states and 67477 transitions. [2019-12-27 01:57:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:41,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:41,836 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] [2019-12-27 01:57:41,836 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:41,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:41,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-27 01:57:41,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:41,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20779774] [2019-12-27 01:57:41,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:42,799 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-27 01:57:42,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20779774] [2019-12-27 01:57:42,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:42,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 01:57:42,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248137219] [2019-12-27 01:57:42,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 01:57:42,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 01:57:42,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-12-27 01:57:42,803 INFO L87 Difference]: Start difference. First operand 21779 states and 67477 transitions. Second operand 20 states. [2019-12-27 01:57:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:46,099 INFO L93 Difference]: Finished difference Result 31852 states and 96603 transitions. [2019-12-27 01:57:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 01:57:46,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-27 01:57:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:46,139 INFO L225 Difference]: With dead ends: 31852 [2019-12-27 01:57:46,139 INFO L226 Difference]: Without dead ends: 27777 [2019-12-27 01:57:46,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=296, Invalid=1774, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 01:57:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27777 states. [2019-12-27 01:57:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27777 to 25859. [2019-12-27 01:57:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25859 states. [2019-12-27 01:57:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25859 states to 25859 states and 78964 transitions. [2019-12-27 01:57:46,532 INFO L78 Accepts]: Start accepts. Automaton has 25859 states and 78964 transitions. Word has length 66 [2019-12-27 01:57:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:46,532 INFO L462 AbstractCegarLoop]: Abstraction has 25859 states and 78964 transitions. [2019-12-27 01:57:46,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 01:57:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 25859 states and 78964 transitions. [2019-12-27 01:57:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:46,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:46,560 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] [2019-12-27 01:57:46,561 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-27 01:57:46,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:46,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251156627] [2019-12-27 01:57:46,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:47,570 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2019-12-27 01:57:47,888 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-27 01:57:47,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251156627] [2019-12-27 01:57:47,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:47,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 01:57:47,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676207355] [2019-12-27 01:57:47,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 01:57:47,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:47,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 01:57:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:57:47,891 INFO L87 Difference]: Start difference. First operand 25859 states and 78964 transitions. Second operand 22 states. [2019-12-27 01:57:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:53,964 INFO L93 Difference]: Finished difference Result 29173 states and 88156 transitions. [2019-12-27 01:57:53,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-27 01:57:53,964 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 01:57:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:54,005 INFO L225 Difference]: With dead ends: 29173 [2019-12-27 01:57:54,006 INFO L226 Difference]: Without dead ends: 27816 [2019-12-27 01:57:54,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=558, Invalid=3474, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 01:57:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27816 states. [2019-12-27 01:57:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27816 to 25309. [2019-12-27 01:57:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25309 states. [2019-12-27 01:57:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25309 states to 25309 states and 77345 transitions. [2019-12-27 01:57:54,406 INFO L78 Accepts]: Start accepts. Automaton has 25309 states and 77345 transitions. Word has length 66 [2019-12-27 01:57:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:54,406 INFO L462 AbstractCegarLoop]: Abstraction has 25309 states and 77345 transitions. [2019-12-27 01:57:54,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 01:57:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 25309 states and 77345 transitions. [2019-12-27 01:57:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:54,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:54,437 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] [2019-12-27 01:57:54,437 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 245055171, now seen corresponding path program 3 times [2019-12-27 01:57:54,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:54,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950857772] [2019-12-27 01:57:54,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:57:54,990 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-27 01:57:54,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950857772] [2019-12-27 01:57:54,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:57:54,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 01:57:54,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648430678] [2019-12-27 01:57:54,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 01:57:54,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:57:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 01:57:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:57:54,992 INFO L87 Difference]: Start difference. First operand 25309 states and 77345 transitions. Second operand 16 states. [2019-12-27 01:57:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:57:59,246 INFO L93 Difference]: Finished difference Result 41627 states and 125757 transitions. [2019-12-27 01:57:59,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 01:57:59,247 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 01:57:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:57:59,301 INFO L225 Difference]: With dead ends: 41627 [2019-12-27 01:57:59,301 INFO L226 Difference]: Without dead ends: 35414 [2019-12-27 01:57:59,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=404, Invalid=1666, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 01:57:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35414 states. [2019-12-27 01:57:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35414 to 26278. [2019-12-27 01:57:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26278 states. [2019-12-27 01:57:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26278 states to 26278 states and 79944 transitions. [2019-12-27 01:57:59,768 INFO L78 Accepts]: Start accepts. Automaton has 26278 states and 79944 transitions. Word has length 66 [2019-12-27 01:57:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:57:59,769 INFO L462 AbstractCegarLoop]: Abstraction has 26278 states and 79944 transitions. [2019-12-27 01:57:59,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 01:57:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 26278 states and 79944 transitions. [2019-12-27 01:57:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:57:59,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:57:59,798 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] [2019-12-27 01:57:59,798 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:57:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:57:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1334990131, now seen corresponding path program 4 times [2019-12-27 01:57:59,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:57:59,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236656086] [2019-12-27 01:57:59,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:57:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:00,735 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-27 01:58:00,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236656086] [2019-12-27 01:58:00,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:00,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 01:58:00,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59894385] [2019-12-27 01:58:00,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 01:58:00,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 01:58:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:58:00,737 INFO L87 Difference]: Start difference. First operand 26278 states and 79944 transitions. Second operand 23 states. [2019-12-27 01:58:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:07,477 INFO L93 Difference]: Finished difference Result 30939 states and 92848 transitions. [2019-12-27 01:58:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 01:58:07,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 01:58:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:07,522 INFO L225 Difference]: With dead ends: 30939 [2019-12-27 01:58:07,522 INFO L226 Difference]: Without dead ends: 29596 [2019-12-27 01:58:07,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=596, Invalid=3826, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 01:58:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29596 states. [2019-12-27 01:58:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29596 to 26404. [2019-12-27 01:58:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26404 states. [2019-12-27 01:58:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26404 states to 26404 states and 80255 transitions. [2019-12-27 01:58:07,943 INFO L78 Accepts]: Start accepts. Automaton has 26404 states and 80255 transitions. Word has length 66 [2019-12-27 01:58:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:07,943 INFO L462 AbstractCegarLoop]: Abstraction has 26404 states and 80255 transitions. [2019-12-27 01:58:07,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 01:58:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26404 states and 80255 transitions. [2019-12-27 01:58:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:07,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:07,973 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] [2019-12-27 01:58:07,973 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:07,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:07,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1345972671, now seen corresponding path program 5 times [2019-12-27 01:58:07,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:07,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751853902] [2019-12-27 01:58:07,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:08,485 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-27 01:58:08,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751853902] [2019-12-27 01:58:08,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:08,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 01:58:08,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538656148] [2019-12-27 01:58:08,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 01:58:08,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:08,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 01:58:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 01:58:08,487 INFO L87 Difference]: Start difference. First operand 26404 states and 80255 transitions. Second operand 17 states. [2019-12-27 01:58:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:14,688 INFO L93 Difference]: Finished difference Result 49447 states and 148377 transitions. [2019-12-27 01:58:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 01:58:14,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 01:58:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:14,742 INFO L225 Difference]: With dead ends: 49447 [2019-12-27 01:58:14,742 INFO L226 Difference]: Without dead ends: 36886 [2019-12-27 01:58:14,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=593, Invalid=2947, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 01:58:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36886 states. [2019-12-27 01:58:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36886 to 26767. [2019-12-27 01:58:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26767 states. [2019-12-27 01:58:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26767 states to 26767 states and 81063 transitions. [2019-12-27 01:58:15,250 INFO L78 Accepts]: Start accepts. Automaton has 26767 states and 81063 transitions. Word has length 66 [2019-12-27 01:58:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 26767 states and 81063 transitions. [2019-12-27 01:58:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 01:58:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26767 states and 81063 transitions. [2019-12-27 01:58:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:15,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:15,285 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] [2019-12-27 01:58:15,285 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:15,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:15,285 INFO L82 PathProgramCache]: Analyzing trace with hash 824750475, now seen corresponding path program 6 times [2019-12-27 01:58:15,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:15,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114002662] [2019-12-27 01:58:15,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:15,668 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-27 01:58:15,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114002662] [2019-12-27 01:58:15,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:15,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:58:15,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044889908] [2019-12-27 01:58:15,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:58:15,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:58:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:58:15,670 INFO L87 Difference]: Start difference. First operand 26767 states and 81063 transitions. Second operand 18 states. [2019-12-27 01:58:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:17,762 INFO L93 Difference]: Finished difference Result 28293 states and 85187 transitions. [2019-12-27 01:58:17,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:58:17,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 01:58:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:17,818 INFO L225 Difference]: With dead ends: 28293 [2019-12-27 01:58:17,819 INFO L226 Difference]: Without dead ends: 28042 [2019-12-27 01:58:17,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:58:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28042 states. [2019-12-27 01:58:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28042 to 26743. [2019-12-27 01:58:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26743 states. [2019-12-27 01:58:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 80991 transitions. [2019-12-27 01:58:18,206 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 80991 transitions. Word has length 66 [2019-12-27 01:58:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:18,206 INFO L462 AbstractCegarLoop]: Abstraction has 26743 states and 80991 transitions. [2019-12-27 01:58:18,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:58:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 80991 transitions. [2019-12-27 01:58:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:18,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:18,234 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] [2019-12-27 01:58:18,234 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:18,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1931146363, now seen corresponding path program 7 times [2019-12-27 01:58:18,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:18,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918185139] [2019-12-27 01:58:18,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:18,814 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-27 01:58:18,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918185139] [2019-12-27 01:58:18,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:18,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 01:58:18,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032362012] [2019-12-27 01:58:18,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 01:58:18,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 01:58:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:58:18,815 INFO L87 Difference]: Start difference. First operand 26743 states and 80991 transitions. Second operand 18 states. [2019-12-27 01:58:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:21,732 INFO L93 Difference]: Finished difference Result 28197 states and 84980 transitions. [2019-12-27 01:58:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 01:58:21,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-27 01:58:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:21,775 INFO L225 Difference]: With dead ends: 28197 [2019-12-27 01:58:21,775 INFO L226 Difference]: Without dead ends: 27970 [2019-12-27 01:58:21,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 01:58:21,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27970 states. [2019-12-27 01:58:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27970 to 26671. [2019-12-27 01:58:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26671 states. [2019-12-27 01:58:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26671 states to 26671 states and 80739 transitions. [2019-12-27 01:58:22,170 INFO L78 Accepts]: Start accepts. Automaton has 26671 states and 80739 transitions. Word has length 66 [2019-12-27 01:58:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:22,171 INFO L462 AbstractCegarLoop]: Abstraction has 26671 states and 80739 transitions. [2019-12-27 01:58:22,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 01:58:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26671 states and 80739 transitions. [2019-12-27 01:58:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:22,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:22,199 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] [2019-12-27 01:58:22,200 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash 501347145, now seen corresponding path program 8 times [2019-12-27 01:58:22,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:22,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53725462] [2019-12-27 01:58:22,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:22,358 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-27 01:58:22,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53725462] [2019-12-27 01:58:22,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:22,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:22,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946504887] [2019-12-27 01:58:22,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:22,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:22,362 INFO L87 Difference]: Start difference. First operand 26671 states and 80739 transitions. Second operand 11 states. [2019-12-27 01:58:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:23,518 INFO L93 Difference]: Finished difference Result 50654 states and 154288 transitions. [2019-12-27 01:58:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 01:58:23,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:58:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:23,573 INFO L225 Difference]: With dead ends: 50654 [2019-12-27 01:58:23,574 INFO L226 Difference]: Without dead ends: 35606 [2019-12-27 01:58:23,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-27 01:58:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35606 states. [2019-12-27 01:58:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35606 to 20449. [2019-12-27 01:58:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20449 states. [2019-12-27 01:58:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20449 states to 20449 states and 62672 transitions. [2019-12-27 01:58:23,987 INFO L78 Accepts]: Start accepts. Automaton has 20449 states and 62672 transitions. Word has length 66 [2019-12-27 01:58:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:23,988 INFO L462 AbstractCegarLoop]: Abstraction has 20449 states and 62672 transitions. [2019-12-27 01:58:23,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20449 states and 62672 transitions. [2019-12-27 01:58:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:24,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:24,008 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] [2019-12-27 01:58:24,008 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:24,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 9 times [2019-12-27 01:58:24,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:24,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943720477] [2019-12-27 01:58:24,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:24,650 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-27 01:58:24,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943720477] [2019-12-27 01:58:24,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:24,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 01:58:24,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287077039] [2019-12-27 01:58:24,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 01:58:24,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:24,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 01:58:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:58:24,653 INFO L87 Difference]: Start difference. First operand 20449 states and 62672 transitions. Second operand 21 states. [2019-12-27 01:58:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:27,948 INFO L93 Difference]: Finished difference Result 22881 states and 68678 transitions. [2019-12-27 01:58:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 01:58:27,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2019-12-27 01:58:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:27,982 INFO L225 Difference]: With dead ends: 22881 [2019-12-27 01:58:27,982 INFO L226 Difference]: Without dead ends: 21834 [2019-12-27 01:58:27,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 01:58:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21834 states. [2019-12-27 01:58:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21834 to 20481. [2019-12-27 01:58:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20481 states. [2019-12-27 01:58:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20481 states to 20481 states and 62732 transitions. [2019-12-27 01:58:28,306 INFO L78 Accepts]: Start accepts. Automaton has 20481 states and 62732 transitions. Word has length 66 [2019-12-27 01:58:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:28,306 INFO L462 AbstractCegarLoop]: Abstraction has 20481 states and 62732 transitions. [2019-12-27 01:58:28,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 01:58:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20481 states and 62732 transitions. [2019-12-27 01:58:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:28,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:28,328 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] [2019-12-27 01:58:28,328 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:28,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1173514763, now seen corresponding path program 10 times [2019-12-27 01:58:28,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:28,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222610109] [2019-12-27 01:58:28,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:28,795 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-27 01:58:28,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222610109] [2019-12-27 01:58:28,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:28,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 01:58:28,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177200600] [2019-12-27 01:58:28,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 01:58:28,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 01:58:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 01:58:28,797 INFO L87 Difference]: Start difference. First operand 20481 states and 62732 transitions. Second operand 16 states. [2019-12-27 01:58:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:33,254 INFO L93 Difference]: Finished difference Result 37968 states and 114905 transitions. [2019-12-27 01:58:33,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 01:58:33,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 01:58:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:33,310 INFO L225 Difference]: With dead ends: 37968 [2019-12-27 01:58:33,311 INFO L226 Difference]: Without dead ends: 37591 [2019-12-27 01:58:33,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=426, Invalid=2226, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 01:58:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37591 states. [2019-12-27 01:58:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37591 to 20481. [2019-12-27 01:58:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20481 states. [2019-12-27 01:58:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20481 states to 20481 states and 62750 transitions. [2019-12-27 01:58:33,751 INFO L78 Accepts]: Start accepts. Automaton has 20481 states and 62750 transitions. Word has length 66 [2019-12-27 01:58:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:33,751 INFO L462 AbstractCegarLoop]: Abstraction has 20481 states and 62750 transitions. [2019-12-27 01:58:33,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 01:58:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20481 states and 62750 transitions. [2019-12-27 01:58:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:33,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:33,773 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] [2019-12-27 01:58:33,773 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -457383415, now seen corresponding path program 11 times [2019-12-27 01:58:33,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:33,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662778217] [2019-12-27 01:58:33,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:33,936 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-27 01:58:33,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662778217] [2019-12-27 01:58:33,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:33,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:33,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94298385] [2019-12-27 01:58:33,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:33,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:33,937 INFO L87 Difference]: Start difference. First operand 20481 states and 62750 transitions. Second operand 11 states. [2019-12-27 01:58:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:35,229 INFO L93 Difference]: Finished difference Result 23764 states and 72149 transitions. [2019-12-27 01:58:35,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 01:58:35,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:58:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:35,264 INFO L225 Difference]: With dead ends: 23764 [2019-12-27 01:58:35,264 INFO L226 Difference]: Without dead ends: 22941 [2019-12-27 01:58:35,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-27 01:58:35,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22941 states. [2019-12-27 01:58:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22941 to 20111. [2019-12-27 01:58:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20111 states. [2019-12-27 01:58:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20111 states to 20111 states and 61734 transitions. [2019-12-27 01:58:35,594 INFO L78 Accepts]: Start accepts. Automaton has 20111 states and 61734 transitions. Word has length 66 [2019-12-27 01:58:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:35,595 INFO L462 AbstractCegarLoop]: Abstraction has 20111 states and 61734 transitions. [2019-12-27 01:58:35,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20111 states and 61734 transitions. [2019-12-27 01:58:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:35,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:35,615 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] [2019-12-27 01:58:35,616 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 579487659, now seen corresponding path program 12 times [2019-12-27 01:58:35,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:35,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041806794] [2019-12-27 01:58:35,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:58:35,772 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-27 01:58:35,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041806794] [2019-12-27 01:58:35,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:58:35,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:58:35,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018361612] [2019-12-27 01:58:35,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:58:35,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:58:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:58:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:58:35,774 INFO L87 Difference]: Start difference. First operand 20111 states and 61734 transitions. Second operand 11 states. [2019-12-27 01:58:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:58:36,944 INFO L93 Difference]: Finished difference Result 24407 states and 74326 transitions. [2019-12-27 01:58:36,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 01:58:36,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 01:58:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:58:36,979 INFO L225 Difference]: With dead ends: 24407 [2019-12-27 01:58:36,979 INFO L226 Difference]: Without dead ends: 24176 [2019-12-27 01:58:36,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 01:58:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24176 states. [2019-12-27 01:58:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24176 to 19919. [2019-12-27 01:58:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19919 states. [2019-12-27 01:58:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19919 states to 19919 states and 61240 transitions. [2019-12-27 01:58:37,312 INFO L78 Accepts]: Start accepts. Automaton has 19919 states and 61240 transitions. Word has length 66 [2019-12-27 01:58:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:58:37,312 INFO L462 AbstractCegarLoop]: Abstraction has 19919 states and 61240 transitions. [2019-12-27 01:58:37,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:58:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 19919 states and 61240 transitions. [2019-12-27 01:58:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:58:37,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:58:37,332 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] [2019-12-27 01:58:37,332 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:58:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:58:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 13 times [2019-12-27 01:58:37,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:58:37,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602456627] [2019-12-27 01:58:37,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:58:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:58:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:58:37,448 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:58:37,448 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:58:37,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t663~0.base_22| 4)) (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t663~0.base_22|)) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~z$w_buff1_used~0_500 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t663~0.base_22|) |v_ULTIMATE.start_main_~#t663~0.offset_16| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t663~0.base_22|) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= |v_ULTIMATE.start_main_~#t663~0.offset_16| 0) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t663~0.base_22| 1)) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t663~0.base=|v_ULTIMATE.start_main_~#t663~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ~x~0=v_~x~0_133, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_14|, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_~#t663~0.offset=|v_ULTIMATE.start_main_~#t663~0.offset_16|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t665~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t663~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t664~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t664~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t663~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:58:37,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:58:37,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t664~0.base_11|) (= |v_ULTIMATE.start_main_~#t664~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t664~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t664~0.base_11| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11|) 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t664~0.base_11| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t664~0.base_11|) |v_ULTIMATE.start_main_~#t664~0.offset_10| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t664~0.base=|v_ULTIMATE.start_main_~#t664~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t664~0.offset=|v_ULTIMATE.start_main_~#t664~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t664~0.base, #length, ULTIMATE.start_main_~#t664~0.offset] because there is no mapped edge [2019-12-27 01:58:37,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t665~0.base_12|) |v_ULTIMATE.start_main_~#t665~0.offset_10| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t665~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t665~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12| 1)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t665~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t665~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t665~0.base_12| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t665~0.base=|v_ULTIMATE.start_main_~#t665~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t665~0.offset=|v_ULTIMATE.start_main_~#t665~0.offset_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t665~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t665~0.offset, #length] because there is no mapped edge [2019-12-27 01:58:37,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1852812777| |P1Thread1of1ForFork2_#t~ite9_Out-1852812777|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1852812777 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1852812777 256)))) (or (and (= ~z$w_buff1~0_In-1852812777 |P1Thread1of1ForFork2_#t~ite9_Out-1852812777|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-1852812777 |P1Thread1of1ForFork2_#t~ite9_Out-1852812777|) .cse2 (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1852812777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852812777, ~z$w_buff1~0=~z$w_buff1~0_In-1852812777, ~z~0=~z~0_In-1852812777} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1852812777|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1852812777, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1852812777|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852812777, ~z$w_buff1~0=~z$w_buff1~0_In-1852812777, ~z~0=~z~0_In-1852812777} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:58:37,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1282287731 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out1282287731| |P2Thread1of1ForFork0_#t~ite24_Out1282287731|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1282287731 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1282287731 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1282287731 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1282287731 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out1282287731| ~z$w_buff1~0_In1282287731)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out1282287731| ~z$w_buff1~0_In1282287731) (= |P2Thread1of1ForFork0_#t~ite23_In1282287731| |P2Thread1of1ForFork0_#t~ite23_Out1282287731|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1282287731, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1282287731|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282287731, ~z$w_buff1~0=~z$w_buff1~0_In1282287731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1282287731, ~weak$$choice2~0=~weak$$choice2~0_In1282287731} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1282287731, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1282287731|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1282287731, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1282287731|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1282287731, ~z$w_buff1~0=~z$w_buff1~0_In1282287731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1282287731, ~weak$$choice2~0=~weak$$choice2~0_In1282287731} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 01:58:37,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse5 (= (mod ~z$w_buff0_used~0_In1130225245 256) 0)) (.cse0 (= (mod ~weak$$choice2~0_In1130225245 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out1130225245| |P2Thread1of1ForFork0_#t~ite30_Out1130225245|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1130225245 256))) (.cse4 (= 0 (mod ~z$r_buff1_thd3~0_In1130225245 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1130225245 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In1130225245| |P2Thread1of1ForFork0_#t~ite28_Out1130225245|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out1130225245| |P2Thread1of1ForFork0_#t~ite29_In1130225245|) (= ~z$w_buff1_used~0_In1130225245 |P2Thread1of1ForFork0_#t~ite30_Out1130225245|) (not .cse0)) (and .cse1 .cse0 (or (and .cse2 .cse3) (and .cse4 .cse3) .cse5) (= |P2Thread1of1ForFork0_#t~ite29_Out1130225245| ~z$w_buff1_used~0_In1130225245)))) (let ((.cse6 (not .cse3))) (and (not .cse5) (= |P2Thread1of1ForFork0_#t~ite29_Out1130225245| |P2Thread1of1ForFork0_#t~ite28_Out1130225245|) .cse0 .cse1 (or (not .cse2) .cse6) (or .cse6 (not .cse4)) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1130225245|))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1130225245|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1130225245, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1130225245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1130225245, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1130225245, ~weak$$choice2~0=~weak$$choice2~0_In1130225245, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1130225245|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1130225245|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1130225245, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1130225245, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1130225245, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1130225245, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1130225245|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1130225245|, ~weak$$choice2~0=~weak$$choice2~0_In1130225245} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:58:37,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 01:58:37,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 01:58:37,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1068324950 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1068324950 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out1068324950| |P2Thread1of1ForFork0_#t~ite38_Out1068324950|))) (or (and (not .cse0) (= ~z$w_buff1~0_In1068324950 |P2Thread1of1ForFork0_#t~ite38_Out1068324950|) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In1068324950 |P2Thread1of1ForFork0_#t~ite38_Out1068324950|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1068324950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1068324950, ~z$w_buff1~0=~z$w_buff1~0_In1068324950, ~z~0=~z~0_In1068324950} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1068324950|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1068324950|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1068324950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1068324950, ~z$w_buff1~0=~z$w_buff1~0_In1068324950, ~z~0=~z~0_In1068324950} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:58:37,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-457328417 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-457328417 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-457328417|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-457328417 |P2Thread1of1ForFork0_#t~ite40_Out-457328417|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-457328417, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-457328417} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-457328417, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-457328417|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-457328417} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:58:37,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In73987988 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In73987988 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In73987988 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In73987988 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out73987988|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In73987988 |P2Thread1of1ForFork0_#t~ite41_Out73987988|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In73987988, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In73987988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In73987988, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In73987988} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In73987988, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In73987988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In73987988, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In73987988, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out73987988|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:58:37,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-849178472 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-849178472 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-849178472|)) (and (= ~z$r_buff0_thd3~0_In-849178472 |P2Thread1of1ForFork0_#t~ite42_Out-849178472|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-849178472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-849178472} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-849178472, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-849178472, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-849178472|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:58:37,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1217325246 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1217325246 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1217325246 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1217325246 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1217325246| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out-1217325246| ~z$r_buff1_thd3~0_In-1217325246) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1217325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1217325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1217325246} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1217325246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1217325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1217325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1217325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1217325246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:58:37,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:58:37,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In811432135 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In811432135 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out811432135|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In811432135 |P0Thread1of1ForFork1_#t~ite5_Out811432135|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In811432135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In811432135} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out811432135|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In811432135, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In811432135} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:58:37,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In409685324 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In409685324 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In409685324 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In409685324 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out409685324| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In409685324 |P0Thread1of1ForFork1_#t~ite6_Out409685324|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In409685324, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In409685324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In409685324, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In409685324} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In409685324, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out409685324|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In409685324, ~z$w_buff1_used~0=~z$w_buff1_used~0_In409685324, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In409685324} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:58:37,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-182742799 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-182742799 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-182742799 ~z$r_buff0_thd1~0_In-182742799) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out-182742799 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-182742799, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-182742799} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-182742799, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-182742799|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-182742799} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:58:37,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd1~0_In-1600568710 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1600568710 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1600568710 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1600568710 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1600568710| ~z$r_buff1_thd1~0_In-1600568710) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1600568710| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1600568710, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1600568710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1600568710, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1600568710} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1600568710|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1600568710, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1600568710, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1600568710, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1600568710} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:58:37,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:58:37,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-321020768 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-321020768 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-321020768|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-321020768| ~z$w_buff0_used~0_In-321020768)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-321020768} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-321020768|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-321020768} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:58:37,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2015679079 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-2015679079 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-2015679079 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2015679079 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-2015679079| ~z$w_buff1_used~0_In-2015679079) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-2015679079|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015679079, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2015679079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015679079, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2015679079} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015679079, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2015679079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015679079, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2015679079|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2015679079} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:58:37,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-2108527698 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2108527698 256)))) (or (and (= ~z$r_buff0_thd2~0_In-2108527698 |P1Thread1of1ForFork2_#t~ite13_Out-2108527698|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-2108527698| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2108527698, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2108527698} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2108527698, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2108527698|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2108527698} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:58:37,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-886889052 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-886889052 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-886889052 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-886889052 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-886889052| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-886889052| ~z$r_buff1_thd2~0_In-886889052) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-886889052, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-886889052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886889052, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-886889052} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-886889052, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-886889052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886889052, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-886889052|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-886889052} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:58:37,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:58:37,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:58:37,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1714178568 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1714178568 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1714178568 |ULTIMATE.start_main_#t~ite47_Out-1714178568|)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1714178568 |ULTIMATE.start_main_#t~ite47_Out-1714178568|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1714178568, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714178568, ~z$w_buff1~0=~z$w_buff1~0_In-1714178568, ~z~0=~z~0_In-1714178568} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1714178568, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1714178568|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714178568, ~z$w_buff1~0=~z$w_buff1~0_In-1714178568, ~z~0=~z~0_In-1714178568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:58:37,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-27 01:58:37,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1922287713 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1922287713 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1922287713|)) (and (= ~z$w_buff0_used~0_In-1922287713 |ULTIMATE.start_main_#t~ite49_Out-1922287713|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922287713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922287713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1922287713|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:58:37,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-24964262 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-24964262 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-24964262 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-24964262 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-24964262 |ULTIMATE.start_main_#t~ite50_Out-24964262|)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-24964262|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-24964262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-24964262|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-24964262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:58:37,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1746067583 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1746067583 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1746067583 |ULTIMATE.start_main_#t~ite51_Out1746067583|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1746067583| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1746067583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1746067583} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1746067583, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1746067583|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1746067583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:58:37,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1494039880 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1494039880 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1494039880 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1494039880 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1494039880| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1494039880 |ULTIMATE.start_main_#t~ite52_Out1494039880|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1494039880, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494039880, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1494039880, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1494039880} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1494039880|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1494039880, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1494039880, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1494039880, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1494039880} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:58:37,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:58:37,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:58:37 BasicIcfg [2019-12-27 01:58:37,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:58:37,572 INFO L168 Benchmark]: Toolchain (without parser) took 149229.65 ms. Allocated memory was 140.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,575 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.27 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 157.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.84 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,576 INFO L168 Benchmark]: Boogie Preprocessor took 47.22 ms. Allocated memory is still 204.5 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,576 INFO L168 Benchmark]: RCFGBuilder took 822.77 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 102.3 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,577 INFO L168 Benchmark]: TraceAbstraction took 147505.97 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 01:58:37,581 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.48 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.27 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 157.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.84 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.22 ms. Allocated memory is still 204.5 MB. Free memory was 155.0 MB in the beginning and 153.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.77 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 102.3 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147505.97 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t663, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t664, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t665, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 147.1s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8222 SDtfs, 11025 SDslu, 38827 SDs, 0 SdLazy, 39369 SolverSat, 598 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 679 GetRequests, 43 SyntacticMatches, 34 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5455 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 245850 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1522 ConstructedInterpolants, 0 QuantifiedInterpolants, 588690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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 proved your program to be incorrect! Received shutdown request...