/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:59:44,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:59:44,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:59:44,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:59:44,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:59:44,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:59:44,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:59:44,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:59:44,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:59:44,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:59:44,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:59:44,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:59:44,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:59:44,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:59:44,572 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:59:44,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:59:44,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:59:44,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:59:44,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:59:44,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:59:44,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:59:44,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:59:44,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:59:44,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:59:44,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:59:44,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:59:44,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:59:44,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:59:44,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:59:44,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:59:44,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:59:44,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:59:44,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:59:44,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:59:44,605 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:59:44,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:59:44,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:59:44,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:59:44,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:59:44,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:59:44,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:59:44,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:59:44,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:59:44,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:59:44,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:59:44,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:59:44,636 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:59:44,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:59:44,636 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:59:44,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:59:44,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:59:44,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:59:44,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:59:44,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:59:44,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:59:44,637 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:59:44,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:59:44,638 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:59:44,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:59:44,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:59:44,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:59:44,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:59:44,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:59:44,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:59:44,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:59:44,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:59:44,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:59:44,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:59:44,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:59:44,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:59:44,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:59:44,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:59:44,936 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:59:44,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:59:44,956 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:59:44,957 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:59:44,958 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:59:44,959 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-26 22:59:45,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5309fe63d/2813dad122db496083dd71921451a488/FLAGfe62ce61e [2019-12-26 22:59:45,623 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:59:45,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_power.oepc.i [2019-12-26 22:59:45,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5309fe63d/2813dad122db496083dd71921451a488/FLAGfe62ce61e [2019-12-26 22:59:45,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5309fe63d/2813dad122db496083dd71921451a488 [2019-12-26 22:59:45,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:59:45,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:59:45,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:59:45,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:59:45,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:59:45,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:59:45" (1/1) ... [2019-12-26 22:59:45,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282c648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:45, skipping insertion in model container [2019-12-26 22:59:45,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:59:45" (1/1) ... [2019-12-26 22:59:45,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:59:46,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:59:46,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:59:46,551 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:59:46,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:59:46,722 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:59:46,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46 WrapperNode [2019-12-26 22:59:46,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:59:46,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:59:46,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:59:46,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:59:46,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:59:46,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:59:46,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:59:46,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:59:46,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (1/1) ... [2019-12-26 22:59:46,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:59:46,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:59:46,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:59:46,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:59:46,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (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-26 22:59:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:59:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:59:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:59:46,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:59:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:59:46,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:59:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:59:46,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:59:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:59:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:59:46,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:59:46,911 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:59:47,621 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:59:47,622 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:59:47,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:59:47 BoogieIcfgContainer [2019-12-26 22:59:47,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:59:47,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:59:47,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:59:47,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:59:47,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:59:45" (1/3) ... [2019-12-26 22:59:47,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c42ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:59:47, skipping insertion in model container [2019-12-26 22:59:47,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:59:46" (2/3) ... [2019-12-26 22:59:47,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c42ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:59:47, skipping insertion in model container [2019-12-26 22:59:47,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:59:47" (3/3) ... [2019-12-26 22:59:47,638 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-12-26 22:59:47,649 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:59:47,650 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:59:47,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:59:47,663 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:59:47,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,703 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,757 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,775 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:59:47,792 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:59:47,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:59:47,815 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:59:47,815 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:59:47,815 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:59:47,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:59:47,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:59:47,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:59:47,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:59:47,835 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-26 22:59:47,837 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 22:59:47,949 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 22:59:47,949 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:59:47,966 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:59:47,982 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-26 22:59:48,068 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-26 22:59:48,068 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:59:48,077 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:59:48,095 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-26 22:59:48,096 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:59:52,901 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-26 22:59:53,016 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 22:59:53,387 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-12-26 22:59:53,387 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-26 22:59:53,392 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-26 22:59:53,932 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-12-26 22:59:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-12-26 22:59:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:59:53,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:53,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:59:53,942 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:53,948 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-12-26 22:59:53,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:53,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822775197] [2019-12-26 22:59:53,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:54,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822775197] [2019-12-26 22:59:54,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:54,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:59:54,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575295931] [2019-12-26 22:59:54,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:54,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:54,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:54,214 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-12-26 22:59:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:54,526 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-12-26 22:59:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:54,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:59:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:54,624 INFO L225 Difference]: With dead ends: 8460 [2019-12-26 22:59:54,624 INFO L226 Difference]: Without dead ends: 7472 [2019-12-26 22:59:54,626 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-26 22:59:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-12-26 22:59:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-12-26 22:59:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-12-26 22:59:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-12-26 22:59:55,111 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-12-26 22:59:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:55,112 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-12-26 22:59:55,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-12-26 22:59:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:59:55,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:55,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:55,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-12-26 22:59:55,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:55,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48242586] [2019-12-26 22:59:55,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:55,230 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-26 22:59:55,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48242586] [2019-12-26 22:59:55,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:55,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:55,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256224612] [2019-12-26 22:59:55,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:55,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:55,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:55,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:55,234 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-12-26 22:59:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:55,693 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-12-26 22:59:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:55,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:59:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:55,788 INFO L225 Difference]: With dead ends: 11704 [2019-12-26 22:59:55,788 INFO L226 Difference]: Without dead ends: 11690 [2019-12-26 22:59:55,791 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-26 22:59:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-12-26 22:59:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-12-26 22:59:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-12-26 22:59:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-12-26 22:59:56,741 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-12-26 22:59:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:56,742 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-12-26 22:59:56,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-12-26 22:59:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:59:56,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:56,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:56,752 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:56,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-12-26 22:59:56,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:56,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936362012] [2019-12-26 22:59:56,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:56,890 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-26 22:59:56,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936362012] [2019-12-26 22:59:56,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:56,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:56,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654676809] [2019-12-26 22:59:56,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:59:56,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:59:56,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:56,895 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-12-26 22:59:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:57,273 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-12-26 22:59:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:59:57,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 22:59:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:57,325 INFO L225 Difference]: With dead ends: 15000 [2019-12-26 22:59:57,325 INFO L226 Difference]: Without dead ends: 15000 [2019-12-26 22:59:57,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:59:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-12-26 22:59:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-12-26 22:59:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-12-26 22:59:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-12-26 22:59:57,869 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-12-26 22:59:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:57,870 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-12-26 22:59:57,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:59:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-12-26 22:59:57,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:59:57,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:57,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:57,874 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:57,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-12-26 22:59:57,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:57,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215502315] [2019-12-26 22:59:57,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:57,929 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-26 22:59:57,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215502315] [2019-12-26 22:59:57,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:57,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:59:57,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464551136] [2019-12-26 22:59:57,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:57,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:57,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:57,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:57,934 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-12-26 22:59:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:57,987 INFO L93 Difference]: Finished difference Result 11883 states and 37480 transitions. [2019-12-26 22:59:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:57,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:59:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,019 INFO L225 Difference]: With dead ends: 11883 [2019-12-26 22:59:58,020 INFO L226 Difference]: Without dead ends: 11883 [2019-12-26 22:59:58,020 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-26 22:59:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11883 states. [2019-12-26 22:59:58,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11883 to 11883. [2019-12-26 22:59:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11883 states. [2019-12-26 22:59:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 37480 transitions. [2019-12-26 22:59:58,356 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 37480 transitions. Word has length 16 [2019-12-26 22:59:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,357 INFO L462 AbstractCegarLoop]: Abstraction has 11883 states and 37480 transitions. [2019-12-26 22:59:58,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 37480 transitions. [2019-12-26 22:59:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:59:58,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,362 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1491434984, now seen corresponding path program 1 times [2019-12-26 22:59:58,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914214492] [2019-12-26 22:59:58,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,413 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-26 22:59:58,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914214492] [2019-12-26 22:59:58,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:58,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173797583] [2019-12-26 22:59:58,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:58,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:58,416 INFO L87 Difference]: Start difference. First operand 11883 states and 37480 transitions. Second operand 3 states. [2019-12-26 22:59:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,624 INFO L93 Difference]: Finished difference Result 19949 states and 62561 transitions. [2019-12-26 22:59:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:58,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 22:59:58,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,650 INFO L225 Difference]: With dead ends: 19949 [2019-12-26 22:59:58,651 INFO L226 Difference]: Without dead ends: 11074 [2019-12-26 22:59:58,651 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-26 22:59:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2019-12-26 22:59:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 10421. [2019-12-26 22:59:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2019-12-26 22:59:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 32037 transitions. [2019-12-26 22:59:58,929 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 32037 transitions. Word has length 17 [2019-12-26 22:59:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,929 INFO L462 AbstractCegarLoop]: Abstraction has 10421 states and 32037 transitions. [2019-12-26 22:59:58,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 32037 transitions. [2019-12-26 22:59:58,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:59:58,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,943 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1843431322, now seen corresponding path program 1 times [2019-12-26 22:59:58,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386754973] [2019-12-26 22:59:58,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,044 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-26 22:59:59,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386754973] [2019-12-26 22:59:59,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:59,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841297515] [2019-12-26 22:59:59,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:59,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:59,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:59,047 INFO L87 Difference]: Start difference. First operand 10421 states and 32037 transitions. Second operand 3 states. [2019-12-26 22:59:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,104 INFO L93 Difference]: Finished difference Result 10421 states and 31528 transitions. [2019-12-26 22:59:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:59,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-26 22:59:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,127 INFO L225 Difference]: With dead ends: 10421 [2019-12-26 22:59:59,128 INFO L226 Difference]: Without dead ends: 10421 [2019-12-26 22:59:59,128 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-26 22:59:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10421 states. [2019-12-26 22:59:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10421 to 10413. [2019-12-26 22:59:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-26 22:59:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 31512 transitions. [2019-12-26 22:59:59,404 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 31512 transitions. Word has length 17 [2019-12-26 22:59:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,404 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 31512 transitions. [2019-12-26 22:59:59,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 31512 transitions. [2019-12-26 22:59:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:59:59,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,411 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash 783398497, now seen corresponding path program 1 times [2019-12-26 22:59:59,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485735655] [2019-12-26 22:59:59,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,491 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-26 22:59:59,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485735655] [2019-12-26 22:59:59,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:59,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245950894] [2019-12-26 22:59:59,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:59,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:59,495 INFO L87 Difference]: Start difference. First operand 10413 states and 31512 transitions. Second operand 4 states. [2019-12-26 22:59:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,539 INFO L93 Difference]: Finished difference Result 1753 states and 4291 transitions. [2019-12-26 22:59:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:59:59,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 22:59:59,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,543 INFO L225 Difference]: With dead ends: 1753 [2019-12-26 22:59:59,544 INFO L226 Difference]: Without dead ends: 1247 [2019-12-26 22:59:59,545 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-26 22:59:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2019-12-26 22:59:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1247. [2019-12-26 22:59:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-26 22:59:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2704 transitions. [2019-12-26 22:59:59,573 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2704 transitions. Word has length 17 [2019-12-26 22:59:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,574 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 2704 transitions. [2019-12-26 22:59:59,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2704 transitions. [2019-12-26 22:59:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:59:59,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,577 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-26 22:59:59,577 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-12-26 22:59:59,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842989813] [2019-12-26 22:59:59,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,873 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-26 22:59:59,901 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-26 22:59:59,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842989813] [2019-12-26 22:59:59,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:59:59,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700888448] [2019-12-26 22:59:59,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:59:59,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:59:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:59:59,904 INFO L87 Difference]: Start difference. First operand 1247 states and 2704 transitions. Second operand 6 states. [2019-12-26 23:00:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,149 INFO L93 Difference]: Finished difference Result 1303 states and 2774 transitions. [2019-12-26 23:00:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:00:00,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:00:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,152 INFO L225 Difference]: With dead ends: 1303 [2019-12-26 23:00:00,152 INFO L226 Difference]: Without dead ends: 1252 [2019-12-26 23:00:00,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:00:00,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2019-12-26 23:00:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1193. [2019-12-26 23:00:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2019-12-26 23:00:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 2589 transitions. [2019-12-26 23:00:00,171 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 2589 transitions. Word has length 25 [2019-12-26 23:00:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,171 INFO L462 AbstractCegarLoop]: Abstraction has 1193 states and 2589 transitions. [2019-12-26 23:00:00,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:00:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 2589 transitions. [2019-12-26 23:00:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:00:00,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:00,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1134333202, now seen corresponding path program 1 times [2019-12-26 23:00:00,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420664170] [2019-12-26 23:00:00,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,245 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-26 23:00:00,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420664170] [2019-12-26 23:00:00,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:00:00,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488683725] [2019-12-26 23:00:00,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:00:00,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:00:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:00,247 INFO L87 Difference]: Start difference. First operand 1193 states and 2589 transitions. Second operand 5 states. [2019-12-26 23:00:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,296 INFO L93 Difference]: Finished difference Result 634 states and 1350 transitions. [2019-12-26 23:00:00,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:00:00,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:00:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,297 INFO L225 Difference]: With dead ends: 634 [2019-12-26 23:00:00,297 INFO L226 Difference]: Without dead ends: 500 [2019-12-26 23:00:00,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:00:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-26 23:00:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-26 23:00:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-26 23:00:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1104 transitions. [2019-12-26 23:00:00,305 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1104 transitions. Word has length 28 [2019-12-26 23:00:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,307 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1104 transitions. [2019-12-26 23:00:00,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:00:00,307 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1104 transitions. [2019-12-26 23:00:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:00,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,311 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-26 23:00:00,312 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-12-26 23:00:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387516829] [2019-12-26 23:00:00,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,360 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-26 23:00:00,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387516829] [2019-12-26 23:00:00,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:00:00,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764634635] [2019-12-26 23:00:00,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:00:00,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:00:00,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:00:00,362 INFO L87 Difference]: Start difference. First operand 500 states and 1104 transitions. Second operand 3 states. [2019-12-26 23:00:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,406 INFO L93 Difference]: Finished difference Result 752 states and 1608 transitions. [2019-12-26 23:00:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:00,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 23:00:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,408 INFO L225 Difference]: With dead ends: 752 [2019-12-26 23:00:00,408 INFO L226 Difference]: Without dead ends: 752 [2019-12-26 23:00:00,409 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-26 23:00:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-26 23:00:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 560. [2019-12-26 23:00:00,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-12-26 23:00:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1224 transitions. [2019-12-26 23:00:00,419 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1224 transitions. Word has length 52 [2019-12-26 23:00:00,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,419 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 1224 transitions. [2019-12-26 23:00:00,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:00:00,420 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1224 transitions. [2019-12-26 23:00:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:00,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,421 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-26 23:00:00,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-12-26 23:00:00,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118964992] [2019-12-26 23:00:00,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,523 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-26 23:00:00,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118964992] [2019-12-26 23:00:00,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:00,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703904828] [2019-12-26 23:00:00,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:00:00,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:00:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:00:00,527 INFO L87 Difference]: Start difference. First operand 560 states and 1224 transitions. Second operand 7 states. [2019-12-26 23:00:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,718 INFO L93 Difference]: Finished difference Result 1089 states and 2305 transitions. [2019-12-26 23:00:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:00:00,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-26 23:00:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,721 INFO L225 Difference]: With dead ends: 1089 [2019-12-26 23:00:00,721 INFO L226 Difference]: Without dead ends: 766 [2019-12-26 23:00:00,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:00:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-12-26 23:00:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 613. [2019-12-26 23:00:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-26 23:00:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1309 transitions. [2019-12-26 23:00:00,731 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1309 transitions. Word has length 52 [2019-12-26 23:00:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1309 transitions. [2019-12-26 23:00:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:00:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1309 transitions. [2019-12-26 23:00:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:00,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,735 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-26 23:00:00,735 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1253874511, now seen corresponding path program 2 times [2019-12-26 23:00:00,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231275966] [2019-12-26 23:00:00,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,915 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-26 23:00:00,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231275966] [2019-12-26 23:00:00,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:00:00,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108325076] [2019-12-26 23:00:00,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:00:00,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:00:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:00:00,919 INFO L87 Difference]: Start difference. First operand 613 states and 1309 transitions. Second operand 8 states. [2019-12-26 23:00:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:01,624 INFO L93 Difference]: Finished difference Result 1183 states and 2418 transitions. [2019-12-26 23:00:01,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:00:01,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-26 23:00:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:01,626 INFO L225 Difference]: With dead ends: 1183 [2019-12-26 23:00:01,627 INFO L226 Difference]: Without dead ends: 1159 [2019-12-26 23:00:01,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:00:01,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-12-26 23:00:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 838. [2019-12-26 23:00:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-26 23:00:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1780 transitions. [2019-12-26 23:00:01,640 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1780 transitions. Word has length 52 [2019-12-26 23:00:01,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:01,641 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1780 transitions. [2019-12-26 23:00:01,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:00:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1780 transitions. [2019-12-26 23:00:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 23:00:01,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:01,644 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-26 23:00:01,644 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:01,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1667381275, now seen corresponding path program 3 times [2019-12-26 23:00:01,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:01,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824938400] [2019-12-26 23:00:01,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:01,774 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-26 23:00:01,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824938400] [2019-12-26 23:00:01,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:01,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:00:01,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646300631] [2019-12-26 23:00:01,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:00:01,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:00:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:01,776 INFO L87 Difference]: Start difference. First operand 838 states and 1780 transitions. Second operand 5 states. [2019-12-26 23:00:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:01,827 INFO L93 Difference]: Finished difference Result 1025 states and 2169 transitions. [2019-12-26 23:00:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:00:01,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-26 23:00:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:01,829 INFO L225 Difference]: With dead ends: 1025 [2019-12-26 23:00:01,830 INFO L226 Difference]: Without dead ends: 1025 [2019-12-26 23:00:01,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:00:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-12-26 23:00:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 803. [2019-12-26 23:00:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-26 23:00:01,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1726 transitions. [2019-12-26 23:00:01,842 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1726 transitions. Word has length 52 [2019-12-26 23:00:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:01,843 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1726 transitions. [2019-12-26 23:00:01,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:00:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1726 transitions. [2019-12-26 23:00:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 23:00:01,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:01,846 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-26 23:00:01,846 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:01,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 1 times [2019-12-26 23:00:01,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:01,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808417172] [2019-12-26 23:00:01,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:01,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:00:01,990 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:00:01,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (= v_~y~0_135 0) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35| 1) |v_#valid_57|) (= v_~y$r_buff0_thd1~0_187 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1441~0.base_35| 4)) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1441~0.base_35|)) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1441~0.base_35|) |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff0_thd2~0_327) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1441~0.base_35|) (= 0 |v_#NULL.base_3|) (= |v_ULTIMATE.start_main_~#t1441~0.offset_27| 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ULTIMATE.start_main_~#t1441~0.base=|v_ULTIMATE.start_main_~#t1441~0.base_35|, ~y~0=v_~y~0_135, ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_15|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1441~0.offset=|v_ULTIMATE.start_main_~#t1441~0.offset_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1441~0.base, ~y~0, ULTIMATE.start_main_~#t1442~0.offset, ULTIMATE.start_main_~#t1442~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1441~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:00:01,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff1_thd0~0_Out-426667519 ~y$r_buff0_thd0~0_In-426667519) (= ~y$r_buff0_thd1~0_In-426667519 ~y$r_buff1_thd1~0_Out-426667519) (= ~x~0_Out-426667519 1) (= ~y$r_buff0_thd1~0_Out-426667519 1) (= ~y$r_buff1_thd2~0_Out-426667519 ~y$r_buff0_thd2~0_In-426667519) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-426667519 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-426667519, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-426667519, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426667519, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-426667519} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-426667519, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-426667519, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-426667519, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-426667519, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-426667519, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-426667519, ~x~0=~x~0_Out-426667519, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-426667519} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:00:01,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11|)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) |v_ULTIMATE.start_main_~#t1442~0.offset_10| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1442~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1442~0.base_11| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1442~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1442~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1442~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1442~0.offset=|v_ULTIMATE.start_main_~#t1442~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t1442~0.base=|v_ULTIMATE.start_main_~#t1442~0.base_11|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1442~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1442~0.base, #length] because there is no mapped edge [2019-12-26 23:00:01,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1726708526 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1726708526 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1726708526|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1726708526| ~y$w_buff0_used~0_In1726708526) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1726708526, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1726708526} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1726708526|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1726708526, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1726708526} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:00:01,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In760731803 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out760731803| ~y$w_buff0~0_In760731803) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In760731803| |P1Thread1of1ForFork1_#t~ite14_Out760731803|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite15_Out760731803| |P1Thread1of1ForFork1_#t~ite14_Out760731803|) (= |P1Thread1of1ForFork1_#t~ite14_Out760731803| ~y$w_buff0~0_In760731803) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In760731803 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In760731803 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In760731803 256))) (= 0 (mod ~y$w_buff0_used~0_In760731803 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760731803, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760731803, ~y$w_buff0~0=~y$w_buff0~0_In760731803, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760731803, ~weak$$choice2~0=~weak$$choice2~0_In760731803, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In760731803|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760731803} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In760731803, ~y$w_buff0_used~0=~y$w_buff0_used~0_In760731803, ~y$w_buff0~0=~y$w_buff0~0_In760731803, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760731803, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out760731803|, ~weak$$choice2~0=~weak$$choice2~0_In760731803, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out760731803|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In760731803} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:00:02,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-236828955 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-236828955| |P1Thread1of1ForFork1_#t~ite21_Out-236828955|) (= |P1Thread1of1ForFork1_#t~ite20_Out-236828955| ~y$w_buff0_used~0_In-236828955) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-236828955 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-236828955 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-236828955 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-236828955 256)) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-236828955| ~y$w_buff0_used~0_In-236828955) (= |P1Thread1of1ForFork1_#t~ite20_In-236828955| |P1Thread1of1ForFork1_#t~ite20_Out-236828955|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-236828955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-236828955, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-236828955|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-236828955, ~weak$$choice2~0=~weak$$choice2~0_In-236828955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-236828955} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-236828955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-236828955, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-236828955|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-236828955, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-236828955|, ~weak$$choice2~0=~weak$$choice2~0_In-236828955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-236828955} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-26 23:00:02,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-26 23:00:02,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1057616411 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-1057616411| ~y$r_buff1_thd2~0_In-1057616411) (= |P1Thread1of1ForFork1_#t~ite29_In-1057616411| |P1Thread1of1ForFork1_#t~ite29_Out-1057616411|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1057616411| ~y$r_buff1_thd2~0_In-1057616411) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1057616411 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1057616411 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1057616411 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1057616411 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-1057616411| |P1Thread1of1ForFork1_#t~ite29_Out-1057616411|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1057616411, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1057616411|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057616411, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1057616411, ~weak$$choice2~0=~weak$$choice2~0_In-1057616411, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057616411} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1057616411, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1057616411|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1057616411|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1057616411, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1057616411, ~weak$$choice2~0=~weak$$choice2~0_In-1057616411, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1057616411} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-26 23:00:02,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-26 23:00:02,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-35938671 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-35938671 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite33_Out-35938671| |P1Thread1of1ForFork1_#t~ite32_Out-35938671|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In-35938671 |P1Thread1of1ForFork1_#t~ite32_Out-35938671|)) (and (or .cse2 .cse0) .cse1 (= ~y~0_In-35938671 |P1Thread1of1ForFork1_#t~ite32_Out-35938671|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-35938671, ~y$w_buff1~0=~y$w_buff1~0_In-35938671, ~y~0=~y~0_In-35938671, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-35938671} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-35938671, ~y$w_buff1~0=~y$w_buff1~0_In-35938671, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-35938671|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-35938671|, ~y~0=~y~0_In-35938671, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-35938671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-26 23:00:02,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1668881744 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1668881744 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1668881744 |P1Thread1of1ForFork1_#t~ite34_Out-1668881744|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1668881744|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1668881744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1668881744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1668881744, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1668881744, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1668881744|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:00:02,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-1052286526 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1052286526 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1052286526 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1052286526 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-1052286526| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1052286526| ~y$w_buff1_used~0_In-1052286526) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1052286526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1052286526, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1052286526, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052286526} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1052286526, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1052286526, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1052286526, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1052286526|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052286526} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:00:02,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In113364948 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In113364948 256)))) (or (and (= ~y$r_buff0_thd2~0_In113364948 |P1Thread1of1ForFork1_#t~ite36_Out113364948|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out113364948| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In113364948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In113364948} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In113364948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In113364948, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out113364948|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:00:02,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-894366101 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-894366101 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-894366101 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-894366101 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-894366101 |P1Thread1of1ForFork1_#t~ite37_Out-894366101|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-894366101|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-894366101, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-894366101, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-894366101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-894366101} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-894366101, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-894366101, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-894366101, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-894366101|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-894366101} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:00:02,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_31|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:00:02,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1275970197 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1275970197 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1275970197 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1275970197 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1275970197| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1275970197| ~y$w_buff1_used~0_In-1275970197)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1275970197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275970197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1275970197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1275970197} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1275970197|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1275970197, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275970197, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1275970197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1275970197} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:00:02,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2074608071 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2074608071 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-2074608071 0)) (and (= ~y$r_buff0_thd1~0_In-2074608071 ~y$r_buff0_thd1~0_Out-2074608071) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074608071, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2074608071} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2074608071, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2074608071|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2074608071} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:00:02,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1549618431 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1549618431 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1549618431 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1549618431 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In1549618431 |P0Thread1of1ForFork0_#t~ite8_Out1549618431|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1549618431|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1549618431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1549618431, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1549618431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1549618431} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1549618431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1549618431, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1549618431|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1549618431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1549618431} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:00:02,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:00:02,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:00:02,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1001564905 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1001564905 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out1001564905| |ULTIMATE.start_main_#t~ite41_Out1001564905|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1001564905| ~y~0_In1001564905) .cse2) (and (not .cse1) (not .cse0) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out1001564905| ~y$w_buff1~0_In1001564905)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1001564905, ~y~0=~y~0_In1001564905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1001564905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1001564905} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1001564905|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1001564905|, ~y$w_buff1~0=~y$w_buff1~0_In1001564905, ~y~0=~y~0_In1001564905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1001564905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1001564905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 23:00:02,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2134811928 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2134811928 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-2134811928|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-2134811928 |ULTIMATE.start_main_#t~ite42_Out-2134811928|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134811928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2134811928} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2134811928, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2134811928, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2134811928|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:00:02,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In605868469 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In605868469 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In605868469 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In605868469 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out605868469|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In605868469 |ULTIMATE.start_main_#t~ite43_Out605868469|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In605868469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In605868469, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In605868469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In605868469} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In605868469, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In605868469, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out605868469|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In605868469, ~y$w_buff1_used~0=~y$w_buff1_used~0_In605868469} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:00:02,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In911697277 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In911697277 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out911697277|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In911697277 |ULTIMATE.start_main_#t~ite44_Out911697277|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In911697277, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911697277} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In911697277, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In911697277, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out911697277|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:00:02,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-820109377 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-820109377 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-820109377 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-820109377 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-820109377|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-820109377| ~y$r_buff1_thd0~0_In-820109377)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-820109377, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-820109377, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-820109377, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-820109377} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-820109377, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-820109377, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-820109377, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-820109377|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-820109377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:00:02,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:00:02,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:00:02 BasicIcfg [2019-12-26 23:00:02,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:00:02,125 INFO L168 Benchmark]: Toolchain (without parser) took 16177.35 ms. Allocated memory was 143.7 MB in the beginning and 601.4 MB in the end (delta: 457.7 MB). Free memory was 99.7 MB in the beginning and 64.9 MB in the end (delta: 34.8 MB). Peak memory consumption was 492.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,126 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.28 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 154.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.87 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,128 INFO L168 Benchmark]: Boogie Preprocessor took 64.54 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,128 INFO L168 Benchmark]: RCFGBuilder took 774.50 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 105.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,129 INFO L168 Benchmark]: TraceAbstraction took 14498.04 ms. Allocated memory was 200.8 MB in the beginning and 601.4 MB in the end (delta: 400.6 MB). Free memory was 104.9 MB in the beginning and 64.9 MB in the end (delta: 40.0 MB). Peak memory consumption was 440.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:02,133 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.54 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.28 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 154.3 MB in the end (delta: -55.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.87 ms. Allocated memory is still 200.8 MB. Free memory was 154.3 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.54 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.50 ms. Allocated memory is still 200.8 MB. Free memory was 149.6 MB in the beginning and 105.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14498.04 ms. Allocated memory was 200.8 MB in the beginning and 601.4 MB in the end (delta: 400.6 MB). Free memory was 104.9 MB in the beginning and 64.9 MB in the end (delta: 40.0 MB). Peak memory consumption was 440.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1408 SDtfs, 1494 SDslu, 2581 SDs, 0 SdLazy, 1355 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 5954 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 41279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...