/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:29:27,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:29:27,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:29:27,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:29:27,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:29:27,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:29:27,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:29:27,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:29:27,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:29:27,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:29:27,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:29:27,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:29:27,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:29:27,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:29:27,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:29:27,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:29:27,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:29:27,214 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:29:27,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:29:27,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:29:27,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:29:27,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:29:27,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:29:27,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:29:27,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:29:27,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:29:27,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:29:27,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:29:27,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:29:27,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:29:27,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:29:27,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:29:27,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:29:27,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:29:27,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:29:27,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:29:27,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:29:27,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:29:27,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:29:27,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:29:27,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:29:27,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:29:27,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:29:27,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:29:27,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:29:27,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:29:27,252 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:29:27,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:29:27,252 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:29:27,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:29:27,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:29:27,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:29:27,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:29:27,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:29:27,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:29:27,254 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:29:27,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:29:27,254 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:29:27,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:29:27,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:29:27,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:29:27,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:29:27,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:29:27,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:29:27,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:29:27,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:29:27,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:29:27,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:29:27,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:29:27,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:29:27,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:29:27,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:29:27,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:29:27,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:29:27,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:29:27,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:29:27,553 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:29:27,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-27 06:29:27,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f85b57c7/3d4ee6a41e1b4ef5a4dc280fe7dbd034/FLAG687176c61 [2019-12-27 06:29:28,182 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:29:28,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2019-12-27 06:29:28,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f85b57c7/3d4ee6a41e1b4ef5a4dc280fe7dbd034/FLAG687176c61 [2019-12-27 06:29:28,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f85b57c7/3d4ee6a41e1b4ef5a4dc280fe7dbd034 [2019-12-27 06:29:28,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:29:28,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:29:28,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:28,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:29:28,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:29:28,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:28" (1/1) ... [2019-12-27 06:29:28,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:28, skipping insertion in model container [2019-12-27 06:29:28,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:29:28" (1/1) ... [2019-12-27 06:29:28,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:29:28,571 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:29:29,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:29,128 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:29:29,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:29:29,277 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:29:29,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29 WrapperNode [2019-12-27 06:29:29,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:29:29,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:29,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:29:29,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:29:29,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,309 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:29:29,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:29:29,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:29:29,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:29:29,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (1/1) ... [2019-12-27 06:29:29,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:29:29,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:29:29,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:29:29,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:29:29,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (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 06:29:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:29:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:29:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:29:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:29:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:29:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:29:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:29:29,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:29:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:29:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:29:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:29:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:29:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:29:29,476 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 06:29:30,297 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:29:30,297 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:29:30,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:30 BoogieIcfgContainer [2019-12-27 06:29:30,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:29:30,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:29:30,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:29:30,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:29:30,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:29:28" (1/3) ... [2019-12-27 06:29:30,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb343a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:30, skipping insertion in model container [2019-12-27 06:29:30,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:29:29" (2/3) ... [2019-12-27 06:29:30,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb343a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:29:30, skipping insertion in model container [2019-12-27 06:29:30,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:29:30" (3/3) ... [2019-12-27 06:29:30,308 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2019-12-27 06:29:30,319 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:29:30,320 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:29:30,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:29:30,329 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:29:30,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,372 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,407 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,408 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,427 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,427 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,471 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,474 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:29:30,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:29:30,531 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:29:30,531 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:29:30,531 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:29:30,531 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:29:30,531 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:29:30,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:29:30,532 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:29:30,532 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:29:30,548 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 06:29:30,550 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:29:30,659 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:29:30,660 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:30,679 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:29:30,703 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:29:30,811 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:29:30,811 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:29:30,824 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:29:30,849 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:29:30,851 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:29:34,534 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:29:34,680 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:29:34,703 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 06:29:34,703 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:29:34,707 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 06:29:52,260 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 06:29:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 06:29:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:29:52,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:29:52,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:29:52,270 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 06:29:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:29:52,279 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 06:29:52,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:29:52,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824881884] [2019-12-27 06:29:52,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:29:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:29:52,610 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 06:29:52,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824881884] [2019-12-27 06:29:52,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:29:52,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:29:52,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348307250] [2019-12-27 06:29:52,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:29:52,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:29:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:29:52,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:29:52,638 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 06:29:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:29:53,907 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 06:29:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:29:53,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:29:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:29:54,666 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 06:29:54,666 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 06:29:54,668 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 06:30:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 06:30:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 06:30:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 06:30:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 06:30:04,091 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 06:30:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:04,091 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 06:30:04,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 06:30:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:30:04,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:04,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:04,096 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 06:30:04,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:04,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 06:30:04,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:04,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167813447] [2019-12-27 06:30:04,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:04,176 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 06:30:04,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167813447] [2019-12-27 06:30:04,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:04,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573081860] [2019-12-27 06:30:04,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:04,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:04,180 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 06:30:08,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:08,540 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 06:30:08,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:08,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:30:08,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:09,610 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 06:30:09,610 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 06:30:09,611 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 06:30:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 06:30:21,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 06:30:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 06:30:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 06:30:22,275 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 06:30:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:22,276 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 06:30:22,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 06:30:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:30:22,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:22,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:22,285 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 06:30:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 06:30:22,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:22,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635286806] [2019-12-27 06:30:22,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:22,375 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 06:30:22,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635286806] [2019-12-27 06:30:22,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:22,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:22,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528933386] [2019-12-27 06:30:22,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:22,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:22,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:22,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:22,377 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 06:30:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:22,496 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 06:30:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:22,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:30:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:22,602 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 06:30:22,602 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 06:30:22,603 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 06:30:27,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 06:30:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 06:30:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 06:30:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 06:30:27,604 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 06:30:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:27,604 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 06:30:27,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 06:30:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:30:27,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:27,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:27,607 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 06:30:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 06:30:27,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:27,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886351411] [2019-12-27 06:30:27,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:27,681 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 06:30:27,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886351411] [2019-12-27 06:30:27,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:27,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:27,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066228575] [2019-12-27 06:30:27,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:27,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:27,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:27,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:27,684 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 06:30:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:28,080 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 06:30:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:28,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:30:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:28,270 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 06:30:28,270 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 06:30:28,270 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 06:30:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 06:30:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 06:30:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 06:30:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 06:30:29,199 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 06:30:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:29,200 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 06:30:29,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 06:30:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:30:29,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:29,210 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 06:30:29,210 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 06:30:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:29,210 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 06:30:29,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:29,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263864232] [2019-12-27 06:30:29,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:29,325 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 06:30:29,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263864232] [2019-12-27 06:30:29,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:29,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:29,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858644] [2019-12-27 06:30:29,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:29,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:29,331 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 5 states. [2019-12-27 06:30:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:29,942 INFO L93 Difference]: Finished difference Result 45733 states and 145470 transitions. [2019-12-27 06:30:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:30:29,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 06:30:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:30,019 INFO L225 Difference]: With dead ends: 45733 [2019-12-27 06:30:30,019 INFO L226 Difference]: Without dead ends: 45726 [2019-12-27 06:30:30,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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 06:30:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45726 states. [2019-12-27 06:30:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45726 to 34769. [2019-12-27 06:30:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-27 06:30:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112450 transitions. [2019-12-27 06:30:31,136 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112450 transitions. Word has length 22 [2019-12-27 06:30:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:31,136 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112450 transitions. [2019-12-27 06:30:31,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112450 transitions. [2019-12-27 06:30:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:30:31,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:31,148 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 06:30:31,148 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 06:30:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 06:30:31,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:31,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846450840] [2019-12-27 06:30:31,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:31,244 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 06:30:31,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846450840] [2019-12-27 06:30:31,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:31,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:31,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692372946] [2019-12-27 06:30:31,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:31,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:31,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:31,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:31,248 INFO L87 Difference]: Start difference. First operand 34769 states and 112450 transitions. Second operand 4 states. [2019-12-27 06:30:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:31,325 INFO L93 Difference]: Finished difference Result 14037 states and 42756 transitions. [2019-12-27 06:30:31,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:31,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:30:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:31,352 INFO L225 Difference]: With dead ends: 14037 [2019-12-27 06:30:31,352 INFO L226 Difference]: Without dead ends: 14037 [2019-12-27 06:30:31,352 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 06:30:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-27 06:30:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-27 06:30:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-27 06:30:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41900 transitions. [2019-12-27 06:30:31,572 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41900 transitions. Word has length 25 [2019-12-27 06:30:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:31,572 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41900 transitions. [2019-12-27 06:30:31,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41900 transitions. [2019-12-27 06:30:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:31,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:31,585 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] [2019-12-27 06:30:31,585 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 06:30:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:31,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 06:30:31,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:31,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792840751] [2019-12-27 06:30:31,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:31,644 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 06:30:31,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792840751] [2019-12-27 06:30:31,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:31,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:31,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70357492] [2019-12-27 06:30:31,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:31,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:31,646 INFO L87 Difference]: Start difference. First operand 13737 states and 41900 transitions. Second operand 3 states. [2019-12-27 06:30:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:31,731 INFO L93 Difference]: Finished difference Result 19578 states and 58726 transitions. [2019-12-27 06:30:31,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:31,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:30:31,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:31,757 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 06:30:31,758 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 06:30:31,758 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 06:30:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 06:30:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-27 06:30:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-27 06:30:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44038 transitions. [2019-12-27 06:30:32,015 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44038 transitions. Word has length 27 [2019-12-27 06:30:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:32,016 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44038 transitions. [2019-12-27 06:30:32,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44038 transitions. [2019-12-27 06:30:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:30:32,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:32,026 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] [2019-12-27 06:30:32,026 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 06:30:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 06:30:32,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:32,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012875438] [2019-12-27 06:30:32,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:32,109 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 06:30:32,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012875438] [2019-12-27 06:30:32,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:32,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:32,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184992724] [2019-12-27 06:30:32,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:32,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:32,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:32,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:32,111 INFO L87 Difference]: Start difference. First operand 14483 states and 44038 transitions. Second operand 6 states. [2019-12-27 06:30:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:32,939 INFO L93 Difference]: Finished difference Result 37116 states and 111354 transitions. [2019-12-27 06:30:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:32,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:30:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:33,017 INFO L225 Difference]: With dead ends: 37116 [2019-12-27 06:30:33,017 INFO L226 Difference]: Without dead ends: 37116 [2019-12-27 06:30:33,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-27 06:30:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-27 06:30:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:30:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62975 transitions. [2019-12-27 06:30:33,782 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62975 transitions. Word has length 27 [2019-12-27 06:30:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:33,782 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62975 transitions. [2019-12-27 06:30:33,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62975 transitions. [2019-12-27 06:30:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:30:33,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:33,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] [2019-12-27 06:30:33,799 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 06:30:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 06:30:33,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:33,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279123264] [2019-12-27 06:30:33,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:33,913 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 06:30:33,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279123264] [2019-12-27 06:30:33,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:33,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:33,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35518993] [2019-12-27 06:30:33,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:30:33,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:33,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:30:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:33,917 INFO L87 Difference]: Start difference. First operand 20406 states and 62975 transitions. Second operand 6 states. [2019-12-27 06:30:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:34,730 INFO L93 Difference]: Finished difference Result 34406 states and 103090 transitions. [2019-12-27 06:30:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:34,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 06:30:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:34,780 INFO L225 Difference]: With dead ends: 34406 [2019-12-27 06:30:34,781 INFO L226 Difference]: Without dead ends: 34406 [2019-12-27 06:30:34,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:30:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-27 06:30:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-27 06:30:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-27 06:30:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62360 transitions. [2019-12-27 06:30:35,211 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62360 transitions. Word has length 28 [2019-12-27 06:30:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:35,211 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62360 transitions. [2019-12-27 06:30:35,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:30:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62360 transitions. [2019-12-27 06:30:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:35,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:35,236 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] [2019-12-27 06:30:35,236 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 06:30:35,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 06:30:35,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:35,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264032996] [2019-12-27 06:30:35,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:35,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 06:30:35,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264032996] [2019-12-27 06:30:35,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:35,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:35,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480056758] [2019-12-27 06:30:35,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:35,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:35,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:35,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:35,360 INFO L87 Difference]: Start difference. First operand 20168 states and 62360 transitions. Second operand 7 states. [2019-12-27 06:30:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:37,053 INFO L93 Difference]: Finished difference Result 46484 states and 138742 transitions. [2019-12-27 06:30:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:30:37,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:30:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:37,132 INFO L225 Difference]: With dead ends: 46484 [2019-12-27 06:30:37,132 INFO L226 Difference]: Without dead ends: 46484 [2019-12-27 06:30:37,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:30:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-27 06:30:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-27 06:30:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-27 06:30:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66323 transitions. [2019-12-27 06:30:37,641 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66323 transitions. Word has length 33 [2019-12-27 06:30:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:37,642 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66323 transitions. [2019-12-27 06:30:37,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66323 transitions. [2019-12-27 06:30:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:37,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:37,664 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] [2019-12-27 06:30:37,664 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 06:30:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:37,664 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 06:30:37,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:37,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492863274] [2019-12-27 06:30:37,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:37,705 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 06:30:37,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492863274] [2019-12-27 06:30:37,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:37,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:37,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224191898] [2019-12-27 06:30:37,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:37,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:37,708 INFO L87 Difference]: Start difference. First operand 21453 states and 66323 transitions. Second operand 3 states. [2019-12-27 06:30:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:37,820 INFO L93 Difference]: Finished difference Result 28695 states and 85797 transitions. [2019-12-27 06:30:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:37,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:30:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:37,859 INFO L225 Difference]: With dead ends: 28695 [2019-12-27 06:30:37,859 INFO L226 Difference]: Without dead ends: 28695 [2019-12-27 06:30:37,859 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 06:30:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-27 06:30:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-27 06:30:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-27 06:30:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61176 transitions. [2019-12-27 06:30:38,211 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61176 transitions. Word has length 33 [2019-12-27 06:30:38,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:38,211 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61176 transitions. [2019-12-27 06:30:38,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61176 transitions. [2019-12-27 06:30:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:30:38,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:38,229 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] [2019-12-27 06:30:38,230 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 06:30:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 06:30:38,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:38,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197929142] [2019-12-27 06:30:38,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:38,687 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-12-27 06:30:38,755 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 06:30:38,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197929142] [2019-12-27 06:30:38,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:38,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:30:38,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009139323] [2019-12-27 06:30:38,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:38,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:38,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:38,759 INFO L87 Difference]: Start difference. First operand 20429 states and 61176 transitions. Second operand 9 states. [2019-12-27 06:30:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:41,214 INFO L93 Difference]: Finished difference Result 50070 states and 147767 transitions. [2019-12-27 06:30:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 06:30:41,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 06:30:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:41,289 INFO L225 Difference]: With dead ends: 50070 [2019-12-27 06:30:41,289 INFO L226 Difference]: Without dead ends: 50070 [2019-12-27 06:30:41,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:30:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50070 states. [2019-12-27 06:30:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50070 to 20857. [2019-12-27 06:30:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20857 states. [2019-12-27 06:30:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20857 states to 20857 states and 62518 transitions. [2019-12-27 06:30:41,817 INFO L78 Accepts]: Start accepts. Automaton has 20857 states and 62518 transitions. Word has length 33 [2019-12-27 06:30:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:41,817 INFO L462 AbstractCegarLoop]: Abstraction has 20857 states and 62518 transitions. [2019-12-27 06:30:41,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 20857 states and 62518 transitions. [2019-12-27 06:30:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:30:41,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30: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] [2019-12-27 06:30:41,836 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 06:30:41,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 06:30:41,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:41,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869768095] [2019-12-27 06:30:41,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:41,924 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 06:30:41,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869768095] [2019-12-27 06:30:41,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:41,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:41,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101243107] [2019-12-27 06:30:41,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:41,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:41,926 INFO L87 Difference]: Start difference. First operand 20857 states and 62518 transitions. Second operand 7 states. [2019-12-27 06:30:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:43,459 INFO L93 Difference]: Finished difference Result 36855 states and 108107 transitions. [2019-12-27 06:30:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:30:43,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:30:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:43,513 INFO L225 Difference]: With dead ends: 36855 [2019-12-27 06:30:43,513 INFO L226 Difference]: Without dead ends: 36855 [2019-12-27 06:30:43,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:30:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36855 states. [2019-12-27 06:30:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36855 to 20079. [2019-12-27 06:30:43,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20079 states. [2019-12-27 06:30:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20079 states to 20079 states and 60181 transitions. [2019-12-27 06:30:43,943 INFO L78 Accepts]: Start accepts. Automaton has 20079 states and 60181 transitions. Word has length 34 [2019-12-27 06:30:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:43,944 INFO L462 AbstractCegarLoop]: Abstraction has 20079 states and 60181 transitions. [2019-12-27 06:30:43,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20079 states and 60181 transitions. [2019-12-27 06:30:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:30:43,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:43,962 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 06:30:43,962 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 06:30:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 06:30:43,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:43,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60380304] [2019-12-27 06:30:43,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:44,127 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 06:30:44,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60380304] [2019-12-27 06:30:44,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:44,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:44,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687075792] [2019-12-27 06:30:44,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:30:44,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:30:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:30:44,129 INFO L87 Difference]: Start difference. First operand 20079 states and 60181 transitions. Second operand 8 states. [2019-12-27 06:30:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:45,651 INFO L93 Difference]: Finished difference Result 41726 states and 121091 transitions. [2019-12-27 06:30:45,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:30:45,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 06:30:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:45,706 INFO L225 Difference]: With dead ends: 41726 [2019-12-27 06:30:45,706 INFO L226 Difference]: Without dead ends: 41726 [2019-12-27 06:30:45,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41726 states. [2019-12-27 06:30:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41726 to 18900. [2019-12-27 06:30:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18900 states. [2019-12-27 06:30:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18900 states to 18900 states and 56770 transitions. [2019-12-27 06:30:46,138 INFO L78 Accepts]: Start accepts. Automaton has 18900 states and 56770 transitions. Word has length 34 [2019-12-27 06:30:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:46,138 INFO L462 AbstractCegarLoop]: Abstraction has 18900 states and 56770 transitions. [2019-12-27 06:30:46,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:30:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 18900 states and 56770 transitions. [2019-12-27 06:30:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:30:46,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:46,159 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] [2019-12-27 06:30:46,159 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 06:30:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 172467434, now seen corresponding path program 1 times [2019-12-27 06:30:46,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:46,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677162002] [2019-12-27 06:30:46,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:46,258 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 06:30:46,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677162002] [2019-12-27 06:30:46,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:46,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:46,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690801578] [2019-12-27 06:30:46,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:46,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:46,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:46,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:46,260 INFO L87 Difference]: Start difference. First operand 18900 states and 56770 transitions. Second operand 7 states. [2019-12-27 06:30:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:47,738 INFO L93 Difference]: Finished difference Result 45215 states and 132609 transitions. [2019-12-27 06:30:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:30:47,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 06:30:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:47,799 INFO L225 Difference]: With dead ends: 45215 [2019-12-27 06:30:47,799 INFO L226 Difference]: Without dead ends: 45215 [2019-12-27 06:30:47,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:30:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45215 states. [2019-12-27 06:30:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45215 to 17884. [2019-12-27 06:30:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17884 states. [2019-12-27 06:30:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17884 states to 17884 states and 53697 transitions. [2019-12-27 06:30:48,237 INFO L78 Accepts]: Start accepts. Automaton has 17884 states and 53697 transitions. Word has length 37 [2019-12-27 06:30:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:48,238 INFO L462 AbstractCegarLoop]: Abstraction has 17884 states and 53697 transitions. [2019-12-27 06:30:48,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 17884 states and 53697 transitions. [2019-12-27 06:30:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:30:48,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:48,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:30:48,259 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 06:30:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1628928242, now seen corresponding path program 1 times [2019-12-27 06:30:48,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:48,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604850469] [2019-12-27 06:30:48,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:48,318 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 06:30:48,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604850469] [2019-12-27 06:30:48,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:48,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:30:48,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534357021] [2019-12-27 06:30:48,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:48,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:48,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:48,320 INFO L87 Difference]: Start difference. First operand 17884 states and 53697 transitions. Second operand 4 states. [2019-12-27 06:30:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:48,441 INFO L93 Difference]: Finished difference Result 30036 states and 90510 transitions. [2019-12-27 06:30:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:48,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 06:30:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:48,472 INFO L225 Difference]: With dead ends: 30036 [2019-12-27 06:30:48,472 INFO L226 Difference]: Without dead ends: 15434 [2019-12-27 06:30:48,472 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 06:30:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15434 states. [2019-12-27 06:30:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15434 to 15340. [2019-12-27 06:30:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15340 states. [2019-12-27 06:30:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15340 states to 15340 states and 45313 transitions. [2019-12-27 06:30:48,758 INFO L78 Accepts]: Start accepts. Automaton has 15340 states and 45313 transitions. Word has length 39 [2019-12-27 06:30:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:48,759 INFO L462 AbstractCegarLoop]: Abstraction has 15340 states and 45313 transitions. [2019-12-27 06:30:48,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15340 states and 45313 transitions. [2019-12-27 06:30:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:30:48,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:48,772 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 06:30:48,772 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 06:30:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-27 06:30:48,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:48,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080530666] [2019-12-27 06:30:48,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:48,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 06:30:48,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080530666] [2019-12-27 06:30:48,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:48,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:48,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70318927] [2019-12-27 06:30:48,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:48,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:48,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:48,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:48,816 INFO L87 Difference]: Start difference. First operand 15340 states and 45313 transitions. Second operand 3 states. [2019-12-27 06:30:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:48,905 INFO L93 Difference]: Finished difference Result 23970 states and 71196 transitions. [2019-12-27 06:30:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:48,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:30:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:48,926 INFO L225 Difference]: With dead ends: 23970 [2019-12-27 06:30:48,926 INFO L226 Difference]: Without dead ends: 11113 [2019-12-27 06:30:48,927 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 06:30:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2019-12-27 06:30:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 11005. [2019-12-27 06:30:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11005 states. [2019-12-27 06:30:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11005 states to 11005 states and 31262 transitions. [2019-12-27 06:30:49,257 INFO L78 Accepts]: Start accepts. Automaton has 11005 states and 31262 transitions. Word has length 39 [2019-12-27 06:30:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:49,258 INFO L462 AbstractCegarLoop]: Abstraction has 11005 states and 31262 transitions. [2019-12-27 06:30:49,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11005 states and 31262 transitions. [2019-12-27 06:30:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:30:49,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:49,277 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 06:30:49,277 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 06:30:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:49,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 1 times [2019-12-27 06:30:49,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:49,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972966644] [2019-12-27 06:30:49,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:49,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972966644] [2019-12-27 06:30:49,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:49,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:30:49,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074288974] [2019-12-27 06:30:49,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:49,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:49,397 INFO L87 Difference]: Start difference. First operand 11005 states and 31262 transitions. Second operand 5 states. [2019-12-27 06:30:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:50,257 INFO L93 Difference]: Finished difference Result 18202 states and 51399 transitions. [2019-12-27 06:30:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:30:50,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:30:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:50,281 INFO L225 Difference]: With dead ends: 18202 [2019-12-27 06:30:50,281 INFO L226 Difference]: Without dead ends: 18202 [2019-12-27 06:30:50,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:30:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18202 states. [2019-12-27 06:30:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18202 to 17039. [2019-12-27 06:30:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17039 states. [2019-12-27 06:30:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17039 states to 17039 states and 48364 transitions. [2019-12-27 06:30:50,542 INFO L78 Accepts]: Start accepts. Automaton has 17039 states and 48364 transitions. Word has length 40 [2019-12-27 06:30:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:50,542 INFO L462 AbstractCegarLoop]: Abstraction has 17039 states and 48364 transitions. [2019-12-27 06:30:50,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17039 states and 48364 transitions. [2019-12-27 06:30:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:30:50,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:50,561 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 06:30:50,561 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 06:30:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 2 times [2019-12-27 06:30:50,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:50,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085593650] [2019-12-27 06:30:50,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:50,617 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 06:30:50,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085593650] [2019-12-27 06:30:50,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:50,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:50,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540414017] [2019-12-27 06:30:50,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:30:50,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:30:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:30:50,619 INFO L87 Difference]: Start difference. First operand 17039 states and 48364 transitions. Second operand 5 states. [2019-12-27 06:30:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:50,700 INFO L93 Difference]: Finished difference Result 15931 states and 45862 transitions. [2019-12-27 06:30:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:30:50,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:30:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:50,717 INFO L225 Difference]: With dead ends: 15931 [2019-12-27 06:30:50,717 INFO L226 Difference]: Without dead ends: 12149 [2019-12-27 06:30:50,718 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 06:30:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2019-12-27 06:30:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11603. [2019-12-27 06:30:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11603 states. [2019-12-27 06:30:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 36051 transitions. [2019-12-27 06:30:50,898 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 36051 transitions. Word has length 40 [2019-12-27 06:30:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:50,899 INFO L462 AbstractCegarLoop]: Abstraction has 11603 states and 36051 transitions. [2019-12-27 06:30:50,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:30:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 36051 transitions. [2019-12-27 06:30:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:50,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:50,912 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 06:30:50,912 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 06:30:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash 987827026, now seen corresponding path program 1 times [2019-12-27 06:30:50,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:50,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649112101] [2019-12-27 06:30:50,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:51,009 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 06:30:51,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649112101] [2019-12-27 06:30:51,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:51,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:30:51,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869738623] [2019-12-27 06:30:51,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:30:51,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:51,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:30:51,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:30:51,011 INFO L87 Difference]: Start difference. First operand 11603 states and 36051 transitions. Second operand 8 states. [2019-12-27 06:30:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:51,827 INFO L93 Difference]: Finished difference Result 31587 states and 96004 transitions. [2019-12-27 06:30:51,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:30:51,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 06:30:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:51,858 INFO L225 Difference]: With dead ends: 31587 [2019-12-27 06:30:51,858 INFO L226 Difference]: Without dead ends: 22364 [2019-12-27 06:30:51,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:30:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-12-27 06:30:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 13002. [2019-12-27 06:30:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13002 states. [2019-12-27 06:30:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13002 states to 13002 states and 40180 transitions. [2019-12-27 06:30:52,130 INFO L78 Accepts]: Start accepts. Automaton has 13002 states and 40180 transitions. Word has length 64 [2019-12-27 06:30:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:52,130 INFO L462 AbstractCegarLoop]: Abstraction has 13002 states and 40180 transitions. [2019-12-27 06:30:52,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:30:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 13002 states and 40180 transitions. [2019-12-27 06:30:52,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:52,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:52,144 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 06:30:52,144 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 06:30:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:52,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-27 06:30:52,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:52,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329817456] [2019-12-27 06:30:52,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:52,227 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 06:30:52,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329817456] [2019-12-27 06:30:52,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:52,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:52,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699798142] [2019-12-27 06:30:52,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:52,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:52,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:52,229 INFO L87 Difference]: Start difference. First operand 13002 states and 40180 transitions. Second operand 7 states. [2019-12-27 06:30:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:52,591 INFO L93 Difference]: Finished difference Result 25517 states and 77689 transitions. [2019-12-27 06:30:52,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:52,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:30:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:52,633 INFO L225 Difference]: With dead ends: 25517 [2019-12-27 06:30:52,633 INFO L226 Difference]: Without dead ends: 18011 [2019-12-27 06:30:52,634 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 06:30:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18011 states. [2019-12-27 06:30:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18011 to 14998. [2019-12-27 06:30:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14998 states. [2019-12-27 06:30:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14998 states to 14998 states and 46106 transitions. [2019-12-27 06:30:53,346 INFO L78 Accepts]: Start accepts. Automaton has 14998 states and 46106 transitions. Word has length 64 [2019-12-27 06:30:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:53,346 INFO L462 AbstractCegarLoop]: Abstraction has 14998 states and 46106 transitions. [2019-12-27 06:30:53,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 14998 states and 46106 transitions. [2019-12-27 06:30:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:53,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:53,361 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 06:30:53,362 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 06:30:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash -838064708, now seen corresponding path program 3 times [2019-12-27 06:30:53,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:53,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554498166] [2019-12-27 06:30:53,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:53,467 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 06:30:53,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554498166] [2019-12-27 06:30:53,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:53,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:53,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268812961] [2019-12-27 06:30:53,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:53,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:53,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:53,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:53,475 INFO L87 Difference]: Start difference. First operand 14998 states and 46106 transitions. Second operand 9 states. [2019-12-27 06:30:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:54,803 INFO L93 Difference]: Finished difference Result 47487 states and 143893 transitions. [2019-12-27 06:30:54,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:30:54,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:30:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:54,893 INFO L225 Difference]: With dead ends: 47487 [2019-12-27 06:30:54,893 INFO L226 Difference]: Without dead ends: 43783 [2019-12-27 06:30:54,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:30:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43783 states. [2019-12-27 06:30:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43783 to 15242. [2019-12-27 06:30:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15242 states. [2019-12-27 06:30:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15242 states to 15242 states and 46856 transitions. [2019-12-27 06:30:55,519 INFO L78 Accepts]: Start accepts. Automaton has 15242 states and 46856 transitions. Word has length 64 [2019-12-27 06:30:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:55,519 INFO L462 AbstractCegarLoop]: Abstraction has 15242 states and 46856 transitions. [2019-12-27 06:30:55,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 15242 states and 46856 transitions. [2019-12-27 06:30:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:55,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:55,537 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 06:30:55,537 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 06:30:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-27 06:30:55,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:55,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195252049] [2019-12-27 06:30:55,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:30:55,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195252049] [2019-12-27 06:30:55,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:55,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:55,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402945682] [2019-12-27 06:30:55,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:55,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:55,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:55,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:55,653 INFO L87 Difference]: Start difference. First operand 15242 states and 46856 transitions. Second operand 9 states. [2019-12-27 06:30:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:56,659 INFO L93 Difference]: Finished difference Result 35308 states and 106791 transitions. [2019-12-27 06:30:56,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:30:56,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:30:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:56,711 INFO L225 Difference]: With dead ends: 35308 [2019-12-27 06:30:56,711 INFO L226 Difference]: Without dead ends: 32492 [2019-12-27 06:30:56,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:30:56,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32492 states. [2019-12-27 06:30:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32492 to 14995. [2019-12-27 06:30:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14995 states. [2019-12-27 06:30:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14995 states to 14995 states and 46188 transitions. [2019-12-27 06:30:57,342 INFO L78 Accepts]: Start accepts. Automaton has 14995 states and 46188 transitions. Word has length 64 [2019-12-27 06:30:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:57,343 INFO L462 AbstractCegarLoop]: Abstraction has 14995 states and 46188 transitions. [2019-12-27 06:30:57,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:30:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14995 states and 46188 transitions. [2019-12-27 06:30:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:57,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:57,360 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 06:30:57,360 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 06:30:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash -406759870, now seen corresponding path program 5 times [2019-12-27 06:30:57,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:57,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810371570] [2019-12-27 06:30:57,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:57,434 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 06:30:57,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810371570] [2019-12-27 06:30:57,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:57,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:30:57,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022376792] [2019-12-27 06:30:57,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:30:57,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:30:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:30:57,436 INFO L87 Difference]: Start difference. First operand 14995 states and 46188 transitions. Second operand 7 states. [2019-12-27 06:30:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:57,718 INFO L93 Difference]: Finished difference Result 25424 states and 76786 transitions. [2019-12-27 06:30:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:30:57,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:30:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:57,745 INFO L225 Difference]: With dead ends: 25424 [2019-12-27 06:30:57,745 INFO L226 Difference]: Without dead ends: 18543 [2019-12-27 06:30:57,746 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 06:30:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18543 states. [2019-12-27 06:30:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18543 to 15177. [2019-12-27 06:30:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15177 states. [2019-12-27 06:30:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15177 states to 15177 states and 46658 transitions. [2019-12-27 06:30:58,023 INFO L78 Accepts]: Start accepts. Automaton has 15177 states and 46658 transitions. Word has length 64 [2019-12-27 06:30:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:58,023 INFO L462 AbstractCegarLoop]: Abstraction has 15177 states and 46658 transitions. [2019-12-27 06:30:58,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:30:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 15177 states and 46658 transitions. [2019-12-27 06:30:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:30:58,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:58,041 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 06:30:58,041 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 06:30:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-27 06:30:58,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:58,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821347501] [2019-12-27 06:30:58,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:58,097 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 06:30:58,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821347501] [2019-12-27 06:30:58,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:58,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:30:58,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577078839] [2019-12-27 06:30:58,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:30:58,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:30:58,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:30:58,099 INFO L87 Difference]: Start difference. First operand 15177 states and 46658 transitions. Second operand 3 states. [2019-12-27 06:30:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:58,214 INFO L93 Difference]: Finished difference Result 17457 states and 53624 transitions. [2019-12-27 06:30:58,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:30:58,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:30:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:58,243 INFO L225 Difference]: With dead ends: 17457 [2019-12-27 06:30:58,243 INFO L226 Difference]: Without dead ends: 17457 [2019-12-27 06:30:58,243 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 06:30:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17457 states. [2019-12-27 06:30:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17457 to 15237. [2019-12-27 06:30:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15237 states. [2019-12-27 06:30:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 47122 transitions. [2019-12-27 06:30:58,515 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 47122 transitions. Word has length 64 [2019-12-27 06:30:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:58,515 INFO L462 AbstractCegarLoop]: Abstraction has 15237 states and 47122 transitions. [2019-12-27 06:30:58,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:30:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 47122 transitions. [2019-12-27 06:30:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:30:58,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:58,534 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 06:30:58,534 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 06:30:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 06:30:58,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:58,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251432254] [2019-12-27 06:30:58,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:58,586 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 06:30:58,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251432254] [2019-12-27 06:30:58,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:58,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:30:58,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564609327] [2019-12-27 06:30:58,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:30:58,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:58,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:30:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:30:58,589 INFO L87 Difference]: Start difference. First operand 15237 states and 47122 transitions. Second operand 4 states. [2019-12-27 06:30:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:30:58,767 INFO L93 Difference]: Finished difference Result 19409 states and 59663 transitions. [2019-12-27 06:30:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:30:58,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:30:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:30:58,794 INFO L225 Difference]: With dead ends: 19409 [2019-12-27 06:30:58,794 INFO L226 Difference]: Without dead ends: 19409 [2019-12-27 06:30:58,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 06:30:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19409 states. [2019-12-27 06:30:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19409 to 15786. [2019-12-27 06:30:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15786 states. [2019-12-27 06:30:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15786 states to 15786 states and 48839 transitions. [2019-12-27 06:30:59,062 INFO L78 Accepts]: Start accepts. Automaton has 15786 states and 48839 transitions. Word has length 65 [2019-12-27 06:30:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:30:59,062 INFO L462 AbstractCegarLoop]: Abstraction has 15786 states and 48839 transitions. [2019-12-27 06:30:59,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:30:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 15786 states and 48839 transitions. [2019-12-27 06:30:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:30:59,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:30:59,079 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 06:30:59,079 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 06:30:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:30:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1591994433, now seen corresponding path program 2 times [2019-12-27 06:30:59,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:30:59,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243647378] [2019-12-27 06:30:59,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:30:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:30:59,262 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 06:30:59,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243647378] [2019-12-27 06:30:59,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:30:59,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:30:59,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660141706] [2019-12-27 06:30:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:30:59,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:30:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:30:59,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:30:59,264 INFO L87 Difference]: Start difference. First operand 15786 states and 48839 transitions. Second operand 9 states. [2019-12-27 06:31:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:00,558 INFO L93 Difference]: Finished difference Result 40948 states and 123085 transitions. [2019-12-27 06:31:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:31:00,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:31:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:00,615 INFO L225 Difference]: With dead ends: 40948 [2019-12-27 06:31:00,615 INFO L226 Difference]: Without dead ends: 33408 [2019-12-27 06:31:00,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:31:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33408 states. [2019-12-27 06:31:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33408 to 15725. [2019-12-27 06:31:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-12-27 06:31:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 48149 transitions. [2019-12-27 06:31:01,188 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 48149 transitions. Word has length 65 [2019-12-27 06:31:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:01,188 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 48149 transitions. [2019-12-27 06:31:01,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:31:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 48149 transitions. [2019-12-27 06:31:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:31:01,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:01,205 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 06:31:01,205 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 06:31:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1318305515, now seen corresponding path program 3 times [2019-12-27 06:31:01,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:01,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785151847] [2019-12-27 06:31:01,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:01,317 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 06:31:01,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785151847] [2019-12-27 06:31:01,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:01,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:31:01,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431413535] [2019-12-27 06:31:01,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:31:01,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:01,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:31:01,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:31:01,319 INFO L87 Difference]: Start difference. First operand 15725 states and 48149 transitions. Second operand 9 states. [2019-12-27 06:31:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:02,207 INFO L93 Difference]: Finished difference Result 32159 states and 96609 transitions. [2019-12-27 06:31:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:31:02,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:31:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:02,247 INFO L225 Difference]: With dead ends: 32159 [2019-12-27 06:31:02,247 INFO L226 Difference]: Without dead ends: 28454 [2019-12-27 06:31:02,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:31:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-27 06:31:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 15211. [2019-12-27 06:31:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15211 states. [2019-12-27 06:31:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15211 states to 15211 states and 46602 transitions. [2019-12-27 06:31:02,598 INFO L78 Accepts]: Start accepts. Automaton has 15211 states and 46602 transitions. Word has length 65 [2019-12-27 06:31:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:02,598 INFO L462 AbstractCegarLoop]: Abstraction has 15211 states and 46602 transitions. [2019-12-27 06:31:02,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:31:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 15211 states and 46602 transitions. [2019-12-27 06:31:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:31:02,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:02,616 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 06:31:02,616 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 06:31:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2022119832, now seen corresponding path program 1 times [2019-12-27 06:31:02,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:02,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753346138] [2019-12-27 06:31:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:02,678 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 06:31:02,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753346138] [2019-12-27 06:31:02,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:02,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:02,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229661221] [2019-12-27 06:31:02,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:02,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:02,680 INFO L87 Difference]: Start difference. First operand 15211 states and 46602 transitions. Second operand 3 states. [2019-12-27 06:31:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:02,750 INFO L93 Difference]: Finished difference Result 13567 states and 40961 transitions. [2019-12-27 06:31:02,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:02,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:31:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:02,774 INFO L225 Difference]: With dead ends: 13567 [2019-12-27 06:31:02,775 INFO L226 Difference]: Without dead ends: 13567 [2019-12-27 06:31:02,775 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 06:31:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13567 states. [2019-12-27 06:31:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13567 to 13375. [2019-12-27 06:31:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13375 states. [2019-12-27 06:31:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13375 states to 13375 states and 40423 transitions. [2019-12-27 06:31:03,107 INFO L78 Accepts]: Start accepts. Automaton has 13375 states and 40423 transitions. Word has length 65 [2019-12-27 06:31:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:03,107 INFO L462 AbstractCegarLoop]: Abstraction has 13375 states and 40423 transitions. [2019-12-27 06:31:03,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13375 states and 40423 transitions. [2019-12-27 06:31:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:31:03,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:03,132 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 06:31:03,132 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 06:31:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1578373453, now seen corresponding path program 1 times [2019-12-27 06:31:03,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:03,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972238792] [2019-12-27 06:31:03,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:31:03,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 06:31:03,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972238792] [2019-12-27 06:31:03,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:31:03,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:31:03,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693996805] [2019-12-27 06:31:03,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:31:03,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:31:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:31:03,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:31:03,232 INFO L87 Difference]: Start difference. First operand 13375 states and 40423 transitions. Second operand 3 states. [2019-12-27 06:31:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:31:03,307 INFO L93 Difference]: Finished difference Result 13375 states and 40422 transitions. [2019-12-27 06:31:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:31:03,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:31:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:31:03,332 INFO L225 Difference]: With dead ends: 13375 [2019-12-27 06:31:03,332 INFO L226 Difference]: Without dead ends: 13375 [2019-12-27 06:31:03,335 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 06:31:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13375 states. [2019-12-27 06:31:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13375 to 12398. [2019-12-27 06:31:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-12-27 06:31:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 37729 transitions. [2019-12-27 06:31:03,904 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 37729 transitions. Word has length 66 [2019-12-27 06:31:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:31:03,905 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 37729 transitions. [2019-12-27 06:31:03,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:31:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 37729 transitions. [2019-12-27 06:31:03,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:31:03,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:31:03,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:31:03,924 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 06:31:03,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:31:03,924 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 06:31:03,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:31:03,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553977233] [2019-12-27 06:31:03,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:31:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:31:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:31:04,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:31:04,103 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:31:04,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_23| 1)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1111~0.base_23|) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= v_~a$r_buff0_thd3~0_77 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1111~0.base_23|) |v_ULTIMATE.start_main_~#t1111~0.offset_18| 0)) |v_#memory_int_21|) (= v_~a$flush_delayed~0_12 0) (= 0 |v_ULTIMATE.start_main_~#t1111~0.offset_18|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1111~0.base_23| 4)) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 v_~__unbuffered_p2_EAX~0_14) (= (select .cse0 |v_ULTIMATE.start_main_~#t1111~0.base_23|) 0) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_21|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t1111~0.base=|v_ULTIMATE.start_main_~#t1111~0.base_23|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_16|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_15|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1111~0.offset=|v_ULTIMATE.start_main_~#t1111~0.offset_18|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1112~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1111~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t1113~0.offset, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t1112~0.offset, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1113~0.base, #NULL.base, ULTIMATE.start_main_~#t1111~0.offset, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:31:04,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1112~0.base_9|) |v_ULTIMATE.start_main_~#t1112~0.offset_7| 1)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1112~0.offset_7|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1112~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1112~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1112~0.base_9|)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1112~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1112~0.base=|v_ULTIMATE.start_main_~#t1112~0.base_9|, ULTIMATE.start_main_~#t1112~0.offset=|v_ULTIMATE.start_main_~#t1112~0.offset_7|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1112~0.base, ULTIMATE.start_main_~#t1112~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:31:04,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1113~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1113~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1113~0.base_9|) |v_ULTIMATE.start_main_~#t1113~0.offset_8| 2))) (= |v_ULTIMATE.start_main_~#t1113~0.offset_8| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1113~0.base_9| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1113~0.offset=|v_ULTIMATE.start_main_~#t1113~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1113~0.base=|v_ULTIMATE.start_main_~#t1113~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1113~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1113~0.base] because there is no mapped edge [2019-12-27 06:31:04,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff0_thd1~0_Out700895104 1) (= ~a$r_buff0_thd0~0_In700895104 ~a$r_buff1_thd0~0_Out700895104) (= ~x~0_In700895104 ~__unbuffered_p0_EAX~0_Out700895104) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In700895104 0)) (= ~a$r_buff0_thd2~0_In700895104 ~a$r_buff1_thd2~0_Out700895104) (= ~a$r_buff1_thd3~0_Out700895104 ~a$r_buff0_thd3~0_In700895104) (= ~a$r_buff1_thd1~0_Out700895104 ~a$r_buff0_thd1~0_In700895104)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700895104, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In700895104, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In700895104, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In700895104, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In700895104, ~x~0=~x~0_In700895104} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out700895104, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out700895104, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out700895104, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out700895104, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out700895104, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In700895104, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In700895104, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In700895104, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out700895104, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In700895104, ~x~0=~x~0_In700895104} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:31:04,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In2071676464 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out2071676464| |P1Thread1of1ForFork2_#t~ite10_Out2071676464|)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In2071676464 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out2071676464| ~a~0_In2071676464)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out2071676464| ~a$w_buff1~0_In2071676464) (not .cse1) .cse0 (not .cse2)))) InVars {~a~0=~a~0_In2071676464, ~a$w_buff1~0=~a$w_buff1~0_In2071676464, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2071676464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2071676464} OutVars{~a~0=~a~0_In2071676464, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2071676464|, ~a$w_buff1~0=~a$w_buff1~0_In2071676464, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2071676464, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out2071676464|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2071676464} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:31:04,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1589963394 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1589963394 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1589963394 256))) (= (mod ~a$w_buff0_used~0_In1589963394 256) 0) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In1589963394 256))))) (= |P2Thread1of1ForFork0_#t~ite20_Out1589963394| ~a$w_buff0~0_In1589963394) (= |P2Thread1of1ForFork0_#t~ite20_Out1589963394| |P2Thread1of1ForFork0_#t~ite21_Out1589963394|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1589963394| ~a$w_buff0~0_In1589963394) (= |P2Thread1of1ForFork0_#t~ite20_In1589963394| |P2Thread1of1ForFork0_#t~ite20_Out1589963394|) (not .cse1)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1589963394, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1589963394, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1589963394, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1589963394, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1589963394, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1589963394|, ~weak$$choice2~0=~weak$$choice2~0_In1589963394} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1589963394|, ~a$w_buff0~0=~a$w_buff0~0_In1589963394, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1589963394, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1589963394, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1589963394, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1589963394|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1589963394, ~weak$$choice2~0=~weak$$choice2~0_In1589963394} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 06:31:04,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-611402943 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-611402943 256)))) (or (and (= ~a$w_buff0_used~0_In-611402943 |P1Thread1of1ForFork2_#t~ite11_Out-611402943|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-611402943|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-611402943, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-611402943} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-611402943, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-611402943, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-611402943|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:31:04,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-773194282 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-773194282 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-773194282 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-773194282 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-773194282|)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-773194282 |P1Thread1of1ForFork2_#t~ite12_Out-773194282|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-773194282, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-773194282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-773194282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-773194282} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-773194282, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-773194282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-773194282, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-773194282|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-773194282} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:31:04,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1113140487 256)))) (or (and (= ~a$w_buff1~0_In1113140487 |P2Thread1of1ForFork0_#t~ite24_Out1113140487|) (= |P2Thread1of1ForFork0_#t~ite23_In1113140487| |P2Thread1of1ForFork0_#t~ite23_Out1113140487|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out1113140487| |P2Thread1of1ForFork0_#t~ite23_Out1113140487|) .cse0 (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1113140487 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1113140487 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1113140487 256) 0)) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1113140487 256))))) (= ~a$w_buff1~0_In1113140487 |P2Thread1of1ForFork0_#t~ite23_Out1113140487|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1113140487, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1113140487|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1113140487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1113140487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1113140487, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1113140487, ~weak$$choice2~0=~weak$$choice2~0_In1113140487} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1113140487, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1113140487|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1113140487|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1113140487, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1113140487, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1113140487, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1113140487, ~weak$$choice2~0=~weak$$choice2~0_In1113140487} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 06:31:04,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In159292803 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out159292803| |P2Thread1of1ForFork0_#t~ite27_Out159292803|) (= |P2Thread1of1ForFork0_#t~ite26_Out159292803| ~a$w_buff0_used~0_In159292803) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In159292803 256) 0))) (or (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In159292803 256))) (and (= (mod ~a$w_buff1_used~0_In159292803 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In159292803 256) 0))) .cse1) (and (= ~a$w_buff0_used~0_In159292803 |P2Thread1of1ForFork0_#t~ite27_Out159292803|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In159292803| |P2Thread1of1ForFork0_#t~ite26_Out159292803|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In159292803|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In159292803, ~a$w_buff0_used~0=~a$w_buff0_used~0_In159292803, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In159292803, ~a$w_buff1_used~0=~a$w_buff1_used~0_In159292803, ~weak$$choice2~0=~weak$$choice2~0_In159292803} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out159292803|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out159292803|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In159292803, ~a$w_buff0_used~0=~a$w_buff0_used~0_In159292803, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In159292803, ~a$w_buff1_used~0=~a$w_buff1_used~0_In159292803, ~weak$$choice2~0=~weak$$choice2~0_In159292803} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:31:04,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1456301977 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1456301977 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1456301977|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1456301977 |P1Thread1of1ForFork2_#t~ite13_Out-1456301977|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1456301977, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1456301977, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1456301977, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1456301977|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:31:04,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-46152458 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-46152458 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-46152458 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-46152458 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-46152458|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-46152458 |P1Thread1of1ForFork2_#t~ite14_Out-46152458|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-46152458, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-46152458, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-46152458, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-46152458} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-46152458, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-46152458, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-46152458, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-46152458, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-46152458|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:31:04,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:31:04,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:31:04,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:31:04,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In602505607 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In602505607 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out602505607| ~a$w_buff1~0_In602505607) (not .cse1)) (and (= ~a~0_In602505607 |P2Thread1of1ForFork0_#t~ite38_Out602505607|) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In602505607, ~a$w_buff1~0=~a$w_buff1~0_In602505607, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In602505607, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602505607} OutVars{~a~0=~a~0_In602505607, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out602505607|, ~a$w_buff1~0=~a$w_buff1~0_In602505607, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In602505607, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602505607} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:31:04,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:31:04,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1075332814 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1075332814 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1075332814|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In1075332814 |P2Thread1of1ForFork0_#t~ite40_Out1075332814|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1075332814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1075332814} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1075332814|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1075332814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1075332814} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:31:04,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-901255175 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-901255175 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-901255175| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-901255175 |P0Thread1of1ForFork1_#t~ite5_Out-901255175|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-901255175} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-901255175|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-901255175} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:31:04,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-167754557 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-167754557 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-167754557 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-167754557 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-167754557|)) (and (= ~a$w_buff1_used~0_In-167754557 |P0Thread1of1ForFork1_#t~ite6_Out-167754557|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-167754557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-167754557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-167754557} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-167754557|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-167754557, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-167754557, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-167754557} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:31:04,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In985517917 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In985517917 256)))) (or (and (= ~a$r_buff0_thd1~0_In985517917 ~a$r_buff0_thd1~0_Out985517917) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out985517917)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In985517917, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In985517917} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out985517917|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In985517917, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out985517917} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:31:04,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1787626736 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1787626736 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1787626736 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1787626736 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1787626736| ~a$r_buff1_thd1~0_In1787626736) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1787626736|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1787626736, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787626736, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1787626736, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1787626736} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1787626736|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1787626736, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787626736, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1787626736, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1787626736} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:31:04,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:31:04,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In2110532794 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In2110532794 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2110532794 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2110532794 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out2110532794| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite41_Out2110532794| ~a$w_buff1_used~0_In2110532794)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2110532794, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2110532794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2110532794} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2110532794, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2110532794, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2110532794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2110532794, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2110532794|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:31:04,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In971447835 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In971447835 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out971447835| ~a$r_buff0_thd3~0_In971447835)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out971447835| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In971447835, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In971447835} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In971447835, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In971447835, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out971447835|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:31:04,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1742055758 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1742055758 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1742055758 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1742055758 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out1742055758| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite43_Out1742055758| ~a$r_buff1_thd3~0_In1742055758) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1742055758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742055758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1742055758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742055758} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1742055758|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1742055758, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742055758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1742055758, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1742055758} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:31:04,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:31:04,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:31:04,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd0~0_In-1783052698 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1783052698| |ULTIMATE.start_main_#t~ite47_Out-1783052698|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1783052698 256)))) (or (and (= ~a~0_In-1783052698 |ULTIMATE.start_main_#t~ite47_Out-1783052698|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~a$w_buff1~0_In-1783052698 |ULTIMATE.start_main_#t~ite47_Out-1783052698|) .cse2 (not .cse0)))) InVars {~a~0=~a~0_In-1783052698, ~a$w_buff1~0=~a$w_buff1~0_In-1783052698, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1783052698, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1783052698} OutVars{~a~0=~a~0_In-1783052698, ~a$w_buff1~0=~a$w_buff1~0_In-1783052698, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1783052698|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1783052698, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1783052698|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1783052698} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:31:04,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-164426591 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-164426591 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-164426591| ~a$w_buff0_used~0_In-164426591) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-164426591| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-164426591, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-164426591} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-164426591, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-164426591|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-164426591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:31:04,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1082281405 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1082281405 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1082281405 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1082281405 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1082281405|)) (and (= ~a$w_buff1_used~0_In1082281405 |ULTIMATE.start_main_#t~ite50_Out1082281405|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1082281405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1082281405} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1082281405|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1082281405, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1082281405, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1082281405, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1082281405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:31:04,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1050655637 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1050655637 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1050655637|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1050655637 |ULTIMATE.start_main_#t~ite51_Out-1050655637|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1050655637} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1050655637|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1050655637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:31:04,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In493896588 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In493896588 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In493896588 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In493896588 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out493896588| ~a$r_buff1_thd0~0_In493896588) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out493896588| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In493896588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In493896588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In493896588} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out493896588|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In493896588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In493896588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In493896588} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:31:04,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:31:04,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:31:04 BasicIcfg [2019-12-27 06:31:04,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:31:04,248 INFO L168 Benchmark]: Toolchain (without parser) took 95766.48 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,251 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.82 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.90 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,252 INFO L168 Benchmark]: Boogie Preprocessor took 49.71 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,253 INFO L168 Benchmark]: RCFGBuilder took 909.13 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 99.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,256 INFO L168 Benchmark]: TraceAbstraction took 93946.28 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:31:04,259 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.82 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.9 MB in the beginning and 154.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.90 ms. Allocated memory is still 202.4 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.71 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.13 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 99.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93946.28 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6595 SDtfs, 9958 SDslu, 17009 SDs, 0 SdLazy, 10508 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred 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: 39.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 296626 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1214 ConstructedInterpolants, 0 QuantifiedInterpolants, 208177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...