/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/mix031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:13:03,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:13:03,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:13:03,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:13:03,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:13:03,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:13:03,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:13:03,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:13:03,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:13:03,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:13:03,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:13:03,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:13:03,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:13:03,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:13:03,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:13:03,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:13:03,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:13:03,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:13:03,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:13:03,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:13:03,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:13:03,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:13:03,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:13:03,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:13:03,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:13:03,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:13:03,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:13:03,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:13:03,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:13:03,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:13:03,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:13:03,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:13:03,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:13:03,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:13:03,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:13:03,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:13:03,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:13:03,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:13:03,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:13:03,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:13:03,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:13:03,399 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:13:03,419 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:13:03,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:13:03,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:13:03,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:13:03,422 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:13:03,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:13:03,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:13:03,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:13:03,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:13:03,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:13:03,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:13:03,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:13:03,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:13:03,425 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:13:03,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:13:03,426 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:13:03,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:13:03,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:13:03,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:13:03,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:13:03,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:13:03,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:03,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:13:03,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:13:03,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:13:03,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:13:03,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:13:03,428 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:13:03,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:13:03,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:13:03,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:13:03,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:13:03,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:13:03,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:13:03,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:13:03,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-27 06:13:03,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cf0d2a/d384fb060e214c3ab59ec8658ea492dd/FLAGe8b03aa5b [2019-12-27 06:13:04,434 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:13:04,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-27 06:13:04,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cf0d2a/d384fb060e214c3ab59ec8658ea492dd/FLAGe8b03aa5b [2019-12-27 06:13:04,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8cf0d2a/d384fb060e214c3ab59ec8658ea492dd [2019-12-27 06:13:04,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:13:04,742 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:13:04,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:04,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:13:04,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:13:04,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:04" (1/1) ... [2019-12-27 06:13:04,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f1d1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:04, skipping insertion in model container [2019-12-27 06:13:04,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:04" (1/1) ... [2019-12-27 06:13:04,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:13:04,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:13:05,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:05,377 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:13:05,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:05,522 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:13:05,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05 WrapperNode [2019-12-27 06:13:05,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:05,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:05,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:13:05,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:13:05,533 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:13:05" (1/1) ... [2019-12-27 06:13:05,553 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:13:05" (1/1) ... [2019-12-27 06:13:05,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:05,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:13:05,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:13:05,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:13:05,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (1/1) ... [2019-12-27 06:13:05,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:13:05,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:13:05,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:13:05,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:13:05,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (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:13:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:13:05,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:13:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:13:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:13:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:13:05,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:13:05,701 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:13:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:13:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:13:05,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:13:05,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:13:05,704 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:13:06,406 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:13:06,407 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:13:06,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:06 BoogieIcfgContainer [2019-12-27 06:13:06,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:13:06,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:13:06,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:13:06,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:13:06,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:04" (1/3) ... [2019-12-27 06:13:06,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8ec381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:06, skipping insertion in model container [2019-12-27 06:13:06,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:05" (2/3) ... [2019-12-27 06:13:06,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8ec381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:06, skipping insertion in model container [2019-12-27 06:13:06,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:06" (3/3) ... [2019-12-27 06:13:06,418 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-12-27 06:13:06,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:13:06,429 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:13:06,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:13:06,438 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:13:06,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,478 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,539 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,540 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:06,566 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:13:06,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:13:06,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:13:06,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:13:06,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:13:06,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:13:06,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:13:06,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:13:06,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:13:06,602 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-27 06:13:06,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 06:13:06,698 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 06:13:06,699 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:06,714 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:13:06,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-27 06:13:06,779 INFO L132 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-27 06:13:06,779 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:06,785 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:13:06,799 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:13:06,800 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:13:10,209 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 06:13:10,327 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:13:10,514 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:13:10,647 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:13:10,669 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56825 [2019-12-27 06:13:10,670 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 06:13:10,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 06:13:11,107 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8850 states. [2019-12-27 06:13:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 8850 states. [2019-12-27 06:13:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:13:11,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:11,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:13:11,117 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash 799211, now seen corresponding path program 1 times [2019-12-27 06:13:11,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:11,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364825684] [2019-12-27 06:13:11,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:11,344 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:13:11,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364825684] [2019-12-27 06:13:11,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:11,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:13:11,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696953353] [2019-12-27 06:13:11,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:11,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:11,364 INFO L87 Difference]: Start difference. First operand 8850 states. Second operand 3 states. [2019-12-27 06:13:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:11,694 INFO L93 Difference]: Finished difference Result 8682 states and 28632 transitions. [2019-12-27 06:13:11,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:11,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:13:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:11,799 INFO L225 Difference]: With dead ends: 8682 [2019-12-27 06:13:11,799 INFO L226 Difference]: Without dead ends: 8178 [2019-12-27 06:13:11,801 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:13:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2019-12-27 06:13:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8178. [2019-12-27 06:13:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8178 states. [2019-12-27 06:13:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8178 states to 8178 states and 26922 transitions. [2019-12-27 06:13:12,276 INFO L78 Accepts]: Start accepts. Automaton has 8178 states and 26922 transitions. Word has length 3 [2019-12-27 06:13:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:12,276 INFO L462 AbstractCegarLoop]: Abstraction has 8178 states and 26922 transitions. [2019-12-27 06:13:12,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8178 states and 26922 transitions. [2019-12-27 06:13:12,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:13:12,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:12,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:12,284 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1718486747, now seen corresponding path program 1 times [2019-12-27 06:13:12,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:12,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484458223] [2019-12-27 06:13:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:12,403 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:13:12,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484458223] [2019-12-27 06:13:12,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:12,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:12,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932953828] [2019-12-27 06:13:12,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:12,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:12,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:12,408 INFO L87 Difference]: Start difference. First operand 8178 states and 26922 transitions. Second operand 3 states. [2019-12-27 06:13:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:12,441 INFO L93 Difference]: Finished difference Result 1311 states and 3027 transitions. [2019-12-27 06:13:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:12,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:13:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:12,451 INFO L225 Difference]: With dead ends: 1311 [2019-12-27 06:13:12,451 INFO L226 Difference]: Without dead ends: 1311 [2019-12-27 06:13:12,452 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:13:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-12-27 06:13:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-12-27 06:13:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-12-27 06:13:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3027 transitions. [2019-12-27 06:13:12,492 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3027 transitions. Word has length 11 [2019-12-27 06:13:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:12,492 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 3027 transitions. [2019-12-27 06:13:12,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3027 transitions. [2019-12-27 06:13:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:12,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:12,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:12,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash 950402147, now seen corresponding path program 1 times [2019-12-27 06:13:12,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:12,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828396309] [2019-12-27 06:13:12,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:12,556 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:13:12,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828396309] [2019-12-27 06:13:12,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:12,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:12,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130819933] [2019-12-27 06:13:12,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:12,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:12,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:12,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:12,559 INFO L87 Difference]: Start difference. First operand 1311 states and 3027 transitions. Second operand 3 states. [2019-12-27 06:13:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:12,655 INFO L93 Difference]: Finished difference Result 2020 states and 4648 transitions. [2019-12-27 06:13:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:12,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 06:13:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:12,666 INFO L225 Difference]: With dead ends: 2020 [2019-12-27 06:13:12,666 INFO L226 Difference]: Without dead ends: 2020 [2019-12-27 06:13:12,667 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:13:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2019-12-27 06:13:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1471. [2019-12-27 06:13:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1471 states. [2019-12-27 06:13:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3484 transitions. [2019-12-27 06:13:12,716 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3484 transitions. Word has length 14 [2019-12-27 06:13:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:12,717 INFO L462 AbstractCegarLoop]: Abstraction has 1471 states and 3484 transitions. [2019-12-27 06:13:12,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3484 transitions. [2019-12-27 06:13:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:12,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:12,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:12,721 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 950504478, now seen corresponding path program 1 times [2019-12-27 06:13:12,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:12,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106130441] [2019-12-27 06:13:12,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:12,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106130441] [2019-12-27 06:13:12,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:12,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:12,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722593920] [2019-12-27 06:13:12,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:12,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:12,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:12,834 INFO L87 Difference]: Start difference. First operand 1471 states and 3484 transitions. Second operand 4 states. [2019-12-27 06:13:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:13,040 INFO L93 Difference]: Finished difference Result 1830 states and 4214 transitions. [2019-12-27 06:13:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:13,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:13:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:13,051 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 06:13:13,051 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 06:13:13,052 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:13:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 06:13:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1766. [2019-12-27 06:13:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-27 06:13:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4090 transitions. [2019-12-27 06:13:13,141 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4090 transitions. Word has length 14 [2019-12-27 06:13:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:13,141 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4090 transitions. [2019-12-27 06:13:13,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4090 transitions. [2019-12-27 06:13:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:13:13,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:13,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:13,143 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 785604646, now seen corresponding path program 1 times [2019-12-27 06:13:13,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:13,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683089560] [2019-12-27 06:13:13,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:13,209 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:13:13,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683089560] [2019-12-27 06:13:13,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:13,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:13,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270824761] [2019-12-27 06:13:13,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:13,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:13,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:13,211 INFO L87 Difference]: Start difference. First operand 1766 states and 4090 transitions. Second operand 4 states. [2019-12-27 06:13:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:13,410 INFO L93 Difference]: Finished difference Result 2141 states and 4886 transitions. [2019-12-27 06:13:13,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:13,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:13:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:13,433 INFO L225 Difference]: With dead ends: 2141 [2019-12-27 06:13:13,433 INFO L226 Difference]: Without dead ends: 2141 [2019-12-27 06:13:13,434 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:13:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2019-12-27 06:13:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1881. [2019-12-27 06:13:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-27 06:13:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4350 transitions. [2019-12-27 06:13:13,484 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4350 transitions. Word has length 14 [2019-12-27 06:13:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:13,485 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4350 transitions. [2019-12-27 06:13:13,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4350 transitions. [2019-12-27 06:13:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:13:13,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:13,488 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:13:13,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1292642456, now seen corresponding path program 1 times [2019-12-27 06:13:13,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:13,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59942857] [2019-12-27 06:13:13,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:13,602 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:13:13,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59942857] [2019-12-27 06:13:13,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:13,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:13,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465872871] [2019-12-27 06:13:13,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:13,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:13,606 INFO L87 Difference]: Start difference. First operand 1881 states and 4350 transitions. Second operand 5 states. [2019-12-27 06:13:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:13,880 INFO L93 Difference]: Finished difference Result 2408 states and 5400 transitions. [2019-12-27 06:13:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:13,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 06:13:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:13,891 INFO L225 Difference]: With dead ends: 2408 [2019-12-27 06:13:13,893 INFO L226 Difference]: Without dead ends: 2408 [2019-12-27 06:13:13,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2019-12-27 06:13:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2152. [2019-12-27 06:13:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2019-12-27 06:13:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 4906 transitions. [2019-12-27 06:13:13,965 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 4906 transitions. Word has length 25 [2019-12-27 06:13:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:13,966 INFO L462 AbstractCegarLoop]: Abstraction has 2152 states and 4906 transitions. [2019-12-27 06:13:13,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 4906 transitions. [2019-12-27 06:13:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:13:13,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:13,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:13,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:13,971 INFO L82 PathProgramCache]: Analyzing trace with hash -797480945, now seen corresponding path program 1 times [2019-12-27 06:13:13,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:13,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728282647] [2019-12-27 06:13:13,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:14,058 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:13:14,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728282647] [2019-12-27 06:13:14,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:14,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:14,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913025098] [2019-12-27 06:13:14,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:14,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:14,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:14,060 INFO L87 Difference]: Start difference. First operand 2152 states and 4906 transitions. Second operand 4 states. [2019-12-27 06:13:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:14,078 INFO L93 Difference]: Finished difference Result 1117 states and 2441 transitions. [2019-12-27 06:13:14,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:14,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 06:13:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:14,088 INFO L225 Difference]: With dead ends: 1117 [2019-12-27 06:13:14,088 INFO L226 Difference]: Without dead ends: 1117 [2019-12-27 06:13:14,088 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:13:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-27 06:13:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1059. [2019-12-27 06:13:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-12-27 06:13:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 2334 transitions. [2019-12-27 06:13:14,120 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 2334 transitions. Word has length 26 [2019-12-27 06:13:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:14,121 INFO L462 AbstractCegarLoop]: Abstraction has 1059 states and 2334 transitions. [2019-12-27 06:13:14,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 2334 transitions. [2019-12-27 06:13:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:13:14,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:14,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:14,125 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:14,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1810395798, now seen corresponding path program 1 times [2019-12-27 06:13:14,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:14,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359245967] [2019-12-27 06:13:14,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:14,233 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:13:14,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359245967] [2019-12-27 06:13:14,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:14,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:14,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202713872] [2019-12-27 06:13:14,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:14,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:14,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:14,236 INFO L87 Difference]: Start difference. First operand 1059 states and 2334 transitions. Second operand 5 states. [2019-12-27 06:13:14,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:14,437 INFO L93 Difference]: Finished difference Result 1193 states and 2576 transitions. [2019-12-27 06:13:14,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:14,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:13:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:14,442 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 06:13:14,442 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 06:13:14,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 06:13:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 955. [2019-12-27 06:13:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-12-27 06:13:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2121 transitions. [2019-12-27 06:13:14,505 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2121 transitions. Word has length 26 [2019-12-27 06:13:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:14,506 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 2121 transitions. [2019-12-27 06:13:14,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2121 transitions. [2019-12-27 06:13:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:14,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:14,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:13:14,509 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 15300526, now seen corresponding path program 1 times [2019-12-27 06:13:14,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:14,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791675384] [2019-12-27 06:13:14,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:14,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791675384] [2019-12-27 06:13:14,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:14,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:14,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934682345] [2019-12-27 06:13:14,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:13:14,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:13:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:14,613 INFO L87 Difference]: Start difference. First operand 955 states and 2121 transitions. Second operand 7 states. [2019-12-27 06:13:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:14,941 INFO L93 Difference]: Finished difference Result 2800 states and 6130 transitions. [2019-12-27 06:13:14,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 06:13:14,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 06:13:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:14,948 INFO L225 Difference]: With dead ends: 2800 [2019-12-27 06:13:14,949 INFO L226 Difference]: Without dead ends: 1901 [2019-12-27 06:13:14,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:13:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-27 06:13:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1056. [2019-12-27 06:13:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 06:13:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2353 transitions. [2019-12-27 06:13:14,978 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2353 transitions. Word has length 51 [2019-12-27 06:13:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:14,979 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2353 transitions. [2019-12-27 06:13:14,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:13:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2353 transitions. [2019-12-27 06:13:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:14,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:14,982 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] [2019-12-27 06:13:14,982 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:14,983 INFO L82 PathProgramCache]: Analyzing trace with hash -671171562, now seen corresponding path program 2 times [2019-12-27 06:13:14,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:14,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917394228] [2019-12-27 06:13:14,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:15,048 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:13:15,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917394228] [2019-12-27 06:13:15,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:15,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:15,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117352997] [2019-12-27 06:13:15,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:15,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:15,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:15,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:15,050 INFO L87 Difference]: Start difference. First operand 1056 states and 2353 transitions. Second operand 4 states. [2019-12-27 06:13:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:15,075 INFO L93 Difference]: Finished difference Result 1633 states and 3700 transitions. [2019-12-27 06:13:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:15,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 06:13:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:15,078 INFO L225 Difference]: With dead ends: 1633 [2019-12-27 06:13:15,078 INFO L226 Difference]: Without dead ends: 622 [2019-12-27 06:13:15,078 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:13:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-27 06:13:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-12-27 06:13:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-27 06:13:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1432 transitions. [2019-12-27 06:13:15,092 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1432 transitions. Word has length 51 [2019-12-27 06:13:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:15,093 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1432 transitions. [2019-12-27 06:13:15,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1432 transitions. [2019-12-27 06:13:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:15,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:15,095 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] [2019-12-27 06:13:15,095 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:15,096 INFO L82 PathProgramCache]: Analyzing trace with hash 898082634, now seen corresponding path program 3 times [2019-12-27 06:13:15,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:15,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430260637] [2019-12-27 06:13:15,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:15,194 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:13:15,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430260637] [2019-12-27 06:13:15,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:15,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:13:15,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447034126] [2019-12-27 06:13:15,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:13:15,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:13:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:13:15,196 INFO L87 Difference]: Start difference. First operand 622 states and 1432 transitions. Second operand 5 states. [2019-12-27 06:13:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:15,434 INFO L93 Difference]: Finished difference Result 743 states and 1651 transitions. [2019-12-27 06:13:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:13:15,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 06:13:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:15,437 INFO L225 Difference]: With dead ends: 743 [2019-12-27 06:13:15,437 INFO L226 Difference]: Without dead ends: 743 [2019-12-27 06:13:15,438 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:13:15,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-27 06:13:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 705. [2019-12-27 06:13:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-12-27 06:13:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1584 transitions. [2019-12-27 06:13:15,452 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1584 transitions. Word has length 51 [2019-12-27 06:13:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:15,452 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1584 transitions. [2019-12-27 06:13:15,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:13:15,452 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1584 transitions. [2019-12-27 06:13:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 06:13:15,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:15,454 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] [2019-12-27 06:13:15,455 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:15,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash 440616472, now seen corresponding path program 4 times [2019-12-27 06:13:15,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:15,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984802599] [2019-12-27 06:13:15,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:15,574 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:13:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984802599] [2019-12-27 06:13:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:15,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:13:15,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982352953] [2019-12-27 06:13:15,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:13:15,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:13:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:13:15,576 INFO L87 Difference]: Start difference. First operand 705 states and 1584 transitions. Second operand 3 states. [2019-12-27 06:13:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:15,590 INFO L93 Difference]: Finished difference Result 704 states and 1582 transitions. [2019-12-27 06:13:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:15,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 06:13:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:15,592 INFO L225 Difference]: With dead ends: 704 [2019-12-27 06:13:15,592 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 06:13:15,593 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:13:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 06:13:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 631. [2019-12-27 06:13:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-27 06:13:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1452 transitions. [2019-12-27 06:13:15,605 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1452 transitions. Word has length 51 [2019-12-27 06:13:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:15,606 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1452 transitions. [2019-12-27 06:13:15,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:13:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1452 transitions. [2019-12-27 06:13:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:13:15,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:15,608 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] [2019-12-27 06:13:15,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash 578834260, now seen corresponding path program 1 times [2019-12-27 06:13:15,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:15,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784689840] [2019-12-27 06:13:15,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:13:15,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784689840] [2019-12-27 06:13:15,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:15,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:13:15,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831956811] [2019-12-27 06:13:15,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:13:15,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:13:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:13:15,795 INFO L87 Difference]: Start difference. First operand 631 states and 1452 transitions. Second operand 8 states. [2019-12-27 06:13:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:16,573 INFO L93 Difference]: Finished difference Result 1037 states and 2202 transitions. [2019-12-27 06:13:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:13:16,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 06:13:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:16,577 INFO L225 Difference]: With dead ends: 1037 [2019-12-27 06:13:16,578 INFO L226 Difference]: Without dead ends: 1037 [2019-12-27 06:13:16,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:13:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-27 06:13:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 746. [2019-12-27 06:13:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-12-27 06:13:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1598 transitions. [2019-12-27 06:13:16,596 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1598 transitions. Word has length 52 [2019-12-27 06:13:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:16,596 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1598 transitions. [2019-12-27 06:13:16,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:13:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1598 transitions. [2019-12-27 06:13:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:13:16,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:16,598 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] [2019-12-27 06:13:16,599 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash -717714874, now seen corresponding path program 2 times [2019-12-27 06:13:16,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:16,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554586788] [2019-12-27 06:13:16,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:16,697 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:13:16,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554586788] [2019-12-27 06:13:16,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:16,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:13:16,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684713542] [2019-12-27 06:13:16,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:16,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:16,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:16,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:16,700 INFO L87 Difference]: Start difference. First operand 746 states and 1598 transitions. Second operand 4 states. [2019-12-27 06:13:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:16,759 INFO L93 Difference]: Finished difference Result 910 states and 1926 transitions. [2019-12-27 06:13:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:13:16,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 06:13:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:16,761 INFO L225 Difference]: With dead ends: 910 [2019-12-27 06:13:16,762 INFO L226 Difference]: Without dead ends: 910 [2019-12-27 06:13:16,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:13:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-27 06:13:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 760. [2019-12-27 06:13:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-12-27 06:13:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1629 transitions. [2019-12-27 06:13:16,779 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1629 transitions. Word has length 52 [2019-12-27 06:13:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:16,781 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1629 transitions. [2019-12-27 06:13:16,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1629 transitions. [2019-12-27 06:13:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:16,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:16,783 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] [2019-12-27 06:13:16,783 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1517325742, now seen corresponding path program 1 times [2019-12-27 06:13:16,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:16,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929393145] [2019-12-27 06:13:16,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:16,871 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:13:16,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929393145] [2019-12-27 06:13:16,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:16,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:16,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072315076] [2019-12-27 06:13:16,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:13:16,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:16,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:13:16,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:13:16,873 INFO L87 Difference]: Start difference. First operand 760 states and 1629 transitions. Second operand 7 states. [2019-12-27 06:13:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:17,101 INFO L93 Difference]: Finished difference Result 1893 states and 3893 transitions. [2019-12-27 06:13:17,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:13:17,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 06:13:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:17,105 INFO L225 Difference]: With dead ends: 1893 [2019-12-27 06:13:17,106 INFO L226 Difference]: Without dead ends: 1551 [2019-12-27 06:13:17,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:13:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2019-12-27 06:13:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 761. [2019-12-27 06:13:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-27 06:13:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1632 transitions. [2019-12-27 06:13:17,125 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1632 transitions. Word has length 53 [2019-12-27 06:13:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:17,125 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1632 transitions. [2019-12-27 06:13:17,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:13:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1632 transitions. [2019-12-27 06:13:17,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:17,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:17,128 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] [2019-12-27 06:13:17,128 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:17,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1731920874, now seen corresponding path program 2 times [2019-12-27 06:13:17,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:17,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684027577] [2019-12-27 06:13:17,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:17,183 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:13:17,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684027577] [2019-12-27 06:13:17,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:17,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:13:17,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015789230] [2019-12-27 06:13:17,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:17,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:17,185 INFO L87 Difference]: Start difference. First operand 761 states and 1632 transitions. Second operand 4 states. [2019-12-27 06:13:17,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:17,378 INFO L93 Difference]: Finished difference Result 1268 states and 2713 transitions. [2019-12-27 06:13:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:13:17,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 06:13:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:17,382 INFO L225 Difference]: With dead ends: 1268 [2019-12-27 06:13:17,383 INFO L226 Difference]: Without dead ends: 1268 [2019-12-27 06:13:17,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:13:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2019-12-27 06:13:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 848. [2019-12-27 06:13:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-12-27 06:13:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1841 transitions. [2019-12-27 06:13:17,411 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1841 transitions. Word has length 53 [2019-12-27 06:13:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:17,411 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1841 transitions. [2019-12-27 06:13:17,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1841 transitions. [2019-12-27 06:13:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:17,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:17,414 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] [2019-12-27 06:13:17,415 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:17,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:17,415 INFO L82 PathProgramCache]: Analyzing trace with hash 912007604, now seen corresponding path program 3 times [2019-12-27 06:13:17,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:17,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899510931] [2019-12-27 06:13:17,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:17,473 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:13:17,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899510931] [2019-12-27 06:13:17,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:17,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:13:17,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840594271] [2019-12-27 06:13:17,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:13:17,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:13:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:13:17,475 INFO L87 Difference]: Start difference. First operand 848 states and 1841 transitions. Second operand 4 states. [2019-12-27 06:13:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:17,674 INFO L93 Difference]: Finished difference Result 1148 states and 2459 transitions. [2019-12-27 06:13:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:13:17,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 06:13:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:17,677 INFO L225 Difference]: With dead ends: 1148 [2019-12-27 06:13:17,677 INFO L226 Difference]: Without dead ends: 1148 [2019-12-27 06:13:17,678 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:13:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-12-27 06:13:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 822. [2019-12-27 06:13:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-27 06:13:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1789 transitions. [2019-12-27 06:13:17,703 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1789 transitions. Word has length 53 [2019-12-27 06:13:17,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:17,703 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1789 transitions. [2019-12-27 06:13:17,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:13:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1789 transitions. [2019-12-27 06:13:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:17,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:17,706 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] [2019-12-27 06:13:17,706 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:17,707 INFO L82 PathProgramCache]: Analyzing trace with hash 444800354, now seen corresponding path program 4 times [2019-12-27 06:13:17,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:17,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158243809] [2019-12-27 06:13:17,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:13:17,827 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:13:17,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158243809] [2019-12-27 06:13:17,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:13:17,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:13:17,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140131910] [2019-12-27 06:13:17,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:13:17,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:13:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:13:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:13:17,833 INFO L87 Difference]: Start difference. First operand 822 states and 1789 transitions. Second operand 6 states. [2019-12-27 06:13:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:13:18,066 INFO L93 Difference]: Finished difference Result 1173 states and 2510 transitions. [2019-12-27 06:13:18,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:13:18,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 06:13:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:13:18,072 INFO L225 Difference]: With dead ends: 1173 [2019-12-27 06:13:18,072 INFO L226 Difference]: Without dead ends: 1173 [2019-12-27 06:13:18,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:13:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-12-27 06:13:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2019-12-27 06:13:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-27 06:13:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1659 transitions. [2019-12-27 06:13:18,107 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1659 transitions. Word has length 53 [2019-12-27 06:13:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:13:18,108 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1659 transitions. [2019-12-27 06:13:18,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:13:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1659 transitions. [2019-12-27 06:13:18,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:13:18,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:13:18,115 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] [2019-12-27 06:13:18,115 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:13:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:13:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 161095200, now seen corresponding path program 1 times [2019-12-27 06:13:18,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:13:18,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333794821] [2019-12-27 06:13:18,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:13:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:13:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:13:18,302 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:13:18,302 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:13:18,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff1_thd2~0_49) (= 0 v_~a$read_delayed~0_7) (= 0 v_~a$w_buff0_used~0_103) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t837~0.base_25| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t837~0.base_25|) |v_ULTIMATE.start_main_~#t837~0.offset_19| 0)) |v_#memory_int_17|) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_p0_EBX~0_13 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t837~0.base_25| 1)) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_34) (= |v_#NULL.offset_2| 0) (= 0 |v_ULTIMATE.start_main_~#t837~0.offset_19|) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~a$w_buff0~0_29) (= 0 v_~a$w_buff1~0_28) (= v_~a$r_buff0_thd1~0_24 0) (= v_~a~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t837~0.base_25|) 0) (= v_~a$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~z~0_9) (= v_~a$r_buff0_thd2~0_76 0) (= v_~y~0_10 0) (= v_~main$tmp_guard0~0_11 0) (= v_~a$read_delayed_var~0.offset_8 0) (= 0 v_~__unbuffered_cnt~0_18) (= 0 v_~a$w_buff1_used~0_68) (= v_~a$r_buff0_thd0~0_19 0) (= 0 |v_#NULL.base_2|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t837~0.base_25| 4) |v_#length_19|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t837~0.base_25|) (= 0 v_~a$r_buff1_thd0~0_20))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_49, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_16|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_76, #NULL.offset=|v_#NULL.offset_2|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_21|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t837~0.base=|v_ULTIMATE.start_main_~#t837~0.base_25|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ~a~0=v_~a~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~a$w_buff1~0=v_~a$w_buff1~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_13, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_2|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~a$w_buff0~0=v_~a$w_buff0~0_29, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ULTIMATE.start_main_~#t837~0.offset=|v_ULTIMATE.start_main_~#t837~0.offset_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_9, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_9, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ULTIMATE.start_main_~#t838~0.offset, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t838~0.base, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t837~0.base, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t837~0.offset, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 06:13:18,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0_used~0_Out-1353131259) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1353131259 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1353131259|) (= |P0Thread1of1ForFork0_#in~arg.base_In-1353131259| P0Thread1of1ForFork0_~arg.base_Out-1353131259) (= ~a$w_buff0~0_Out-1353131259 1) (= ~a$w_buff1~0_Out-1353131259 ~a$w_buff0~0_In-1353131259) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1353131259| P0Thread1of1ForFork0_~arg.offset_Out-1353131259) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1353131259|) (= 0 (mod ~a$w_buff1_used~0_Out-1353131259 256)) (= ~a$w_buff1_used~0_Out-1353131259 ~a$w_buff0_used~0_In-1353131259)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1353131259|, ~a$w_buff0~0=~a$w_buff0~0_In-1353131259, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1353131259|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1353131259} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1353131259|, ~a$w_buff1~0=~a$w_buff1~0_Out-1353131259, ~a$w_buff0~0=~a$w_buff0~0_Out-1353131259, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1353131259, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1353131259|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1353131259, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1353131259, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1353131259, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1353131259|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1353131259} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:13:18,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L814-1-->L816: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t838~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10|) 0) (not (= |v_ULTIMATE.start_main_~#t838~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t838~0.offset_9|) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t838~0.base_10| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t838~0.base_10|) |v_ULTIMATE.start_main_~#t838~0.offset_9| 1)) |v_#memory_int_7|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t838~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t838~0.offset=|v_ULTIMATE.start_main_~#t838~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t838~0.base=|v_ULTIMATE.start_main_~#t838~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t838~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t838~0.base] because there is no mapped edge [2019-12-27 06:13:18,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In916296072 256)))) (or (and (= ~a$w_buff1_used~0_In916296072 |P1Thread1of1ForFork1_#t~ite23_Out916296072|) (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In916296072 256) 0))) (or (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In916296072 256))) (= 0 (mod ~a$w_buff0_used~0_In916296072 256)) (and .cse0 (= (mod ~a$r_buff1_thd2~0_In916296072 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite24_Out916296072| |P1Thread1of1ForFork1_#t~ite23_Out916296072|) .cse1) (and (= ~a$w_buff1_used~0_In916296072 |P1Thread1of1ForFork1_#t~ite24_Out916296072|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_In916296072| |P1Thread1of1ForFork1_#t~ite23_Out916296072|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In916296072, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In916296072, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In916296072|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In916296072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In916296072, ~weak$$choice2~0=~weak$$choice2~0_In916296072} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In916296072, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out916296072|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In916296072, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out916296072|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In916296072, ~a$w_buff1_used~0=~a$w_buff1_used~0_In916296072, ~weak$$choice2~0=~weak$$choice2~0_In916296072} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-27 06:13:18,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_26 256))) (= v_~a$r_buff0_thd2~0_68 v_~a$r_buff0_thd2~0_67)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_26, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:13:18,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1319719484 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In1319719484 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1319719484|) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1319719484| ~a$w_buff0_used~0_In1319719484)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1319719484, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1319719484} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1319719484|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1319719484, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1319719484} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:13:18,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-388019119 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-388019119 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-388019119 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-388019119 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-388019119|)) (and (= ~a$w_buff1_used~0_In-388019119 |P0Thread1of1ForFork0_#t~ite6_Out-388019119|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-388019119, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-388019119, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-388019119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-388019119} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-388019119|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-388019119, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-388019119, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-388019119, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-388019119} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:13:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1406143484 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1406143484 256)))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out-1406143484 0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_In-1406143484 ~a$r_buff0_thd1~0_Out-1406143484) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1406143484, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1406143484} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1406143484|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1406143484, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1406143484} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:13:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In1057098297 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In1057098297 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1057098297 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1057098297 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1057098297| ~a$r_buff1_thd1~0_In1057098297) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1057098297| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1057098297, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1057098297, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1057098297, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1057098297} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1057098297, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1057098297|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1057098297, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1057098297, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1057098297} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:13:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~a$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:13:18,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_18 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{~a~0=v_~a~0_18, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 06:13:18,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out413142964| |P1Thread1of1ForFork1_#t~ite32_Out413142964|)) (.cse2 (= (mod ~a$w_buff1_used~0_In413142964 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In413142964 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In413142964 |P1Thread1of1ForFork1_#t~ite32_Out413142964|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out413142964| ~a~0_In413142964) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In413142964, ~a$w_buff1~0=~a$w_buff1~0_In413142964, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In413142964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In413142964} OutVars{~a~0=~a~0_In413142964, ~a$w_buff1~0=~a$w_buff1~0_In413142964, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In413142964, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out413142964|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out413142964|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In413142964} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:13:18,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In617228217 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In617228217 256)))) (or (and (= ~a$w_buff0_used~0_In617228217 |P1Thread1of1ForFork1_#t~ite34_Out617228217|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out617228217| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In617228217, ~a$w_buff0_used~0=~a$w_buff0_used~0_In617228217} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out617228217|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In617228217, ~a$w_buff0_used~0=~a$w_buff0_used~0_In617228217} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:13:18,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2001835346 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In2001835346 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In2001835346 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In2001835346 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out2001835346| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out2001835346| ~a$w_buff1_used~0_In2001835346)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2001835346, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2001835346, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2001835346, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2001835346} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2001835346, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2001835346, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2001835346, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out2001835346|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2001835346} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:13:18,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1121396835 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1121396835 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1121396835 |P1Thread1of1ForFork1_#t~ite36_Out-1121396835|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1121396835|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1121396835, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1121396835} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1121396835, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1121396835, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1121396835|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:13:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd2~0_In1843140516 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1843140516 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1843140516 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1843140516 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1843140516| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1843140516| ~a$r_buff1_thd2~0_In1843140516) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1843140516, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1843140516, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1843140516, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1843140516} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1843140516, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1843140516, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1843140516, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1843140516, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1843140516|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:13:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~a$r_buff1_thd2~0_42 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_42, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:13:18,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 06:13:18,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-177014794 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-177014794 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-177014794| ~a~0_In-177014794) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-177014794| ~a$w_buff1~0_In-177014794) (not .cse1)))) InVars {~a~0=~a~0_In-177014794, ~a$w_buff1~0=~a$w_buff1~0_In-177014794, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-177014794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-177014794} OutVars{~a~0=~a~0_In-177014794, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-177014794|, ~a$w_buff1~0=~a$w_buff1~0_In-177014794, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-177014794, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-177014794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:13:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_16 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{~a~0=v_~a~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:13:18,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In815788169 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In815788169 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out815788169| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out815788169| ~a$w_buff0_used~0_In815788169)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In815788169, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In815788169} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In815788169, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In815788169, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out815788169|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:13:18,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In565024984 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In565024984 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In565024984 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In565024984 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out565024984|)) (and (= |ULTIMATE.start_main_#t~ite43_Out565024984| ~a$w_buff1_used~0_In565024984) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In565024984, ~a$w_buff0_used~0=~a$w_buff0_used~0_In565024984, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In565024984, ~a$w_buff1_used~0=~a$w_buff1_used~0_In565024984} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In565024984, ~a$w_buff0_used~0=~a$w_buff0_used~0_In565024984, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In565024984, ~a$w_buff1_used~0=~a$w_buff1_used~0_In565024984, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out565024984|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:13:18,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In758029283 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In758029283 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out758029283|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In758029283 |ULTIMATE.start_main_#t~ite44_Out758029283|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In758029283, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In758029283} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In758029283, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In758029283, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out758029283|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:13:18,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1592442840 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1592442840 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1592442840 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1592442840 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1592442840|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1592442840| ~a$r_buff1_thd0~0_In-1592442840)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1592442840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1592442840, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1592442840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1592442840} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1592442840, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1592442840, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1592442840, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1592442840, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1592442840|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:13:18,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~a$r_buff1_thd0~0_13) (= v_~__unbuffered_p0_EBX~0_6 0) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_6, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:13:18,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:13:18 BasicIcfg [2019-12-27 06:13:18,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:13:18,452 INFO L168 Benchmark]: Toolchain (without parser) took 13711.04 ms. Allocated memory was 145.2 MB in the beginning and 436.2 MB in the end (delta: 291.0 MB). Free memory was 101.3 MB in the beginning and 249.0 MB in the end (delta: -147.7 MB). Peak memory consumption was 143.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:18,455 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 06:13:18,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.93 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:18,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.08 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:18,457 INFO L168 Benchmark]: Boogie Preprocessor took 44.55 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:18,457 INFO L168 Benchmark]: RCFGBuilder took 774.15 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 106.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:18,460 INFO L168 Benchmark]: TraceAbstraction took 12040.88 ms. Allocated memory was 202.4 MB in the beginning and 436.2 MB in the end (delta: 233.8 MB). Free memory was 105.7 MB in the beginning and 249.0 MB in the end (delta: -143.3 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:13:18,465 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.50 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.93 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 156.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.08 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 153.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.55 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.15 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 106.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12040.88 ms. Allocated memory was 202.4 MB in the beginning and 436.2 MB in the end (delta: 233.8 MB). Free memory was 105.7 MB in the beginning and 249.0 MB in the end (delta: -143.3 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 151 ProgramPointsBefore, 78 ProgramPointsAfterwards, 185 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 25 ChoiceCompositions, 5025 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 56825 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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] [L816] FCALL, FORK 0 pthread_create(&t838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=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=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 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) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 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 [L791] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, 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=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 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) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 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 [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 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 [L825] 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 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2090 SDtfs, 2218 SDslu, 4102 SDs, 0 SdLazy, 2241 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8850occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4760 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 706 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 101932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...