/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:51:17,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:51:17,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:51:17,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:51:17,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:51:17,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:51:17,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:51:17,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:51:17,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:51:17,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:51:17,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:51:17,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:51:17,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:51:17,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:51:17,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:51:17,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:51:17,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:51:17,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:51:17,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:51:17,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:51:17,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:51:17,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:51:17,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:51:17,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:51:17,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:51:17,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:51:17,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:51:17,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:51:17,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:51:17,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:51:17,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:51:17,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:51:17,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:51:17,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:51:17,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:51:17,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:51:17,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:51:17,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:51:17,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:51:17,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:51:17,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:51:17,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:51:17,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:51:17,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:51:17,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:51:17,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:51:17,670 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:51:17,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:51:17,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:51:17,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:51:17,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:51:17,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:51:17,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:51:17,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:51:17,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:51:17,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:51:17,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:51:17,672 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:51:17,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:51:17,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:51:17,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:51:17,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:51:17,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:51:17,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:51:17,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:51:17,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:51:17,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:51:17,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:51:17,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:51:17,677 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:51:17,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:51:17,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:51:17,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:51:17,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:51:18,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:51:18,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:51:18,002 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:51:18,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-27 07:51:18,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca623688c/1e77dd6ee25b46d58da507c6e45b79fb/FLAGaec8b21cd [2019-12-27 07:51:18,657 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:51:18,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-27 07:51:18,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca623688c/1e77dd6ee25b46d58da507c6e45b79fb/FLAGaec8b21cd [2019-12-27 07:51:18,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca623688c/1e77dd6ee25b46d58da507c6e45b79fb [2019-12-27 07:51:18,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:51:18,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:51:18,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:18,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:51:18,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:51:18,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:18" (1/1) ... [2019-12-27 07:51:18,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:18, skipping insertion in model container [2019-12-27 07:51:18,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:18" (1/1) ... [2019-12-27 07:51:18,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:51:18,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:51:19,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:19,602 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:51:19,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:19,789 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:51:19,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19 WrapperNode [2019-12-27 07:51:19,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:19,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:19,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:51:19,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:51:19,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:19,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:51:19,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:51:19,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:51:19,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... [2019-12-27 07:51:19,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:51:19,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:51:19,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:51:19,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:51:19,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:51:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:51:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:51:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:51:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:51:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:51:19,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:51:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:51:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:51:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:51:19,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:51:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:51:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:51:19,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:51:19,982 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:51:20,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:51:20,832 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:51:20,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:20 BoogieIcfgContainer [2019-12-27 07:51:20,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:51:20,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:51:20,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:51:20,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:51:20,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:51:18" (1/3) ... [2019-12-27 07:51:20,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c483984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:20, skipping insertion in model container [2019-12-27 07:51:20,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:19" (2/3) ... [2019-12-27 07:51:20,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c483984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:20, skipping insertion in model container [2019-12-27 07:51:20,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:20" (3/3) ... [2019-12-27 07:51:20,842 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2019-12-27 07:51:20,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:51:20,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:51:20,861 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:51:20,862 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:51:20,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,935 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,971 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:20,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:51:21,013 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:51:21,014 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:51:21,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:51:21,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:51:21,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:51:21,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:51:21,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:51:21,014 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:51:21,030 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 07:51:21,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:21,145 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:21,145 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:21,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:51:21,191 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:21,274 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:21,275 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:21,283 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:51:21,305 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:51:21,306 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:51:25,171 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:51:25,282 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:51:25,310 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 07:51:25,311 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 07:51:25,314 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 07:51:40,374 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 07:51:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 07:51:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:51:40,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:51:40,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:51:40,385 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:51:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:51:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 07:51:40,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:51:40,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237557174] [2019-12-27 07:51:40,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:51:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:51:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:51:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237557174] [2019-12-27 07:51:40,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:51:40,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:51:40,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135187144] [2019-12-27 07:51:40,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:51:40,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:51:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:51:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:51:40,657 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 07:51:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:51:42,102 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 07:51:42,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:51:42,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:51:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:51:42,820 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 07:51:42,820 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 07:51:42,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:51:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 07:51:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 07:51:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 07:51:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 07:51:52,249 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 07:51:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:51:52,250 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 07:51:52,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:51:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 07:51:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:51:52,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:51:52,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:51:52,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:51:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:51:52,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 07:51:52,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:51:52,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575727509] [2019-12-27 07:51:52,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:51:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:51:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:51:52,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575727509] [2019-12-27 07:51:52,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:51:52,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:51:52,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305542089] [2019-12-27 07:51:52,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:51:52,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:51:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:51:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:51:52,431 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 07:51:57,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:51:57,709 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 07:51:57,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:51:57,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:51:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:51:58,346 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 07:51:58,347 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 07:51:58,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 07:52:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 07:52:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 07:52:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 07:52:09,849 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 07:52:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:09,850 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 07:52:09,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 07:52:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:52:09,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:09,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:09,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 07:52:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:09,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586191288] [2019-12-27 07:52:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:09,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586191288] [2019-12-27 07:52:09,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:09,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:09,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977374006] [2019-12-27 07:52:09,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:09,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:09,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:09,928 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 07:52:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:10,064 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 07:52:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:10,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:52:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:10,158 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 07:52:10,158 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 07:52:10,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 07:52:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 07:52:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 07:52:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 07:52:10,847 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 07:52:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:10,848 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 07:52:10,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 07:52:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:52:10,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:10,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:10,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:10,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 07:52:10,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:10,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760099304] [2019-12-27 07:52:10,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:10,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760099304] [2019-12-27 07:52:10,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:10,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:10,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176663546] [2019-12-27 07:52:10,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:10,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:10,978 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 07:52:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:11,471 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 07:52:11,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:52:11,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 07:52:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:11,580 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 07:52:11,581 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 07:52:11,581 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-27 07:52:14,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 07:52:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 07:52:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 07:52:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 07:52:14,745 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 07:52:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:14,746 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 07:52:14,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 07:52:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:52:14,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:14,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:14,755 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 07:52:14,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:14,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440991783] [2019-12-27 07:52:14,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:14,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440991783] [2019-12-27 07:52:14,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:14,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:14,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032643981] [2019-12-27 07:52:14,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:14,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:14,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:14,892 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 07:52:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:15,965 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 07:52:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:52:15,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:52:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:16,061 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 07:52:16,062 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 07:52:16,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:52:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 07:52:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 07:52:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 07:52:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 07:52:17,281 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 07:52:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:17,281 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 07:52:17,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 07:52:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:52:17,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:17,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:17,296 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 07:52:17,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:17,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987726232] [2019-12-27 07:52:17,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:17,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987726232] [2019-12-27 07:52:17,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:17,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:17,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575606831] [2019-12-27 07:52:17,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:17,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:17,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:17,406 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 07:52:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:17,479 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 07:52:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:17,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:52:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:17,505 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 07:52:17,505 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 07:52:17,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 07:52:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 07:52:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 07:52:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 07:52:17,735 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 07:52:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:17,736 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 07:52:17,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 07:52:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:52:17,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:17,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:17,747 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 07:52:17,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:17,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568245948] [2019-12-27 07:52:17,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:17,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568245948] [2019-12-27 07:52:17,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:17,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:17,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377462197] [2019-12-27 07:52:17,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:17,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:17,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:17,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:17,869 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 07:52:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:18,501 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 07:52:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:52:18,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 07:52:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:18,542 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 07:52:18,542 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 07:52:18,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:52:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 07:52:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 07:52:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 07:52:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 07:52:18,922 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 07:52:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:18,922 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 07:52:18,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 07:52:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:52:18,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:18,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:18,942 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 07:52:18,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:18,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273273413] [2019-12-27 07:52:18,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:19,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273273413] [2019-12-27 07:52:19,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:19,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:19,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368465380] [2019-12-27 07:52:19,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:19,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:19,068 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 07:52:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:20,345 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 07:52:20,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:52:20,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 07:52:20,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:20,380 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 07:52:20,380 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 07:52:20,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:52:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 07:52:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 07:52:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 07:52:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 07:52:20,677 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 07:52:20,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:20,677 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 07:52:20,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 07:52:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:52:20,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:20,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:20,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:20,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 07:52:20,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:20,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762017126] [2019-12-27 07:52:20,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:20,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762017126] [2019-12-27 07:52:20,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:20,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:52:20,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295507157] [2019-12-27 07:52:20,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:20,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:20,763 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 07:52:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:21,049 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 07:52:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:21,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:52:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:21,078 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 07:52:21,078 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 07:52:21,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 07:52:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 07:52:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 07:52:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 07:52:21,309 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 07:52:21,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:21,310 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 07:52:21,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:21,310 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 07:52:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:21,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:21,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:21,330 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 07:52:21,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:21,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226190639] [2019-12-27 07:52:21,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:21,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:21,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226190639] [2019-12-27 07:52:21,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:21,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:21,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410404700] [2019-12-27 07:52:21,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:21,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:21,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:21,396 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 07:52:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:21,544 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 07:52:21,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:21,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 07:52:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:21,580 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 07:52:21,580 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 07:52:21,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 07:52:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 07:52:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 07:52:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 07:52:21,955 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 07:52:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:21,955 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 07:52:21,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 07:52:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:21,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:21,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:21,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 07:52:21,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:21,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066952459] [2019-12-27 07:52:21,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:22,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066952459] [2019-12-27 07:52:22,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:22,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:22,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926146369] [2019-12-27 07:52:22,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:22,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:22,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:22,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:22,069 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 5 states. [2019-12-27 07:52:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:22,679 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 07:52:22,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:52:22,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:52:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:22,711 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 07:52:22,711 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 07:52:22,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 07:52:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 07:52:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 07:52:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 07:52:23,036 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 07:52:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:23,036 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 07:52:23,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 07:52:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:23,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:23,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:23,055 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 07:52:23,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:23,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889853978] [2019-12-27 07:52:23,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:23,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889853978] [2019-12-27 07:52:23,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:23,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:23,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247582902] [2019-12-27 07:52:23,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:23,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:23,123 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 5 states. [2019-12-27 07:52:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:23,219 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 07:52:23,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:23,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:52:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:23,255 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 07:52:23,255 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 07:52:23,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 07:52:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 07:52:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 07:52:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 07:52:23,566 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 07:52:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:23,567 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 07:52:23,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 07:52:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:23,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:23,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:23,588 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 07:52:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:23,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608335522] [2019-12-27 07:52:23,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:23,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608335522] [2019-12-27 07:52:23,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:23,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:23,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204826711] [2019-12-27 07:52:23,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:23,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:23,635 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 07:52:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:23,773 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 07:52:23,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:23,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:52:23,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:23,948 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 07:52:23,948 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 07:52:23,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 07:52:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 07:52:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 07:52:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 07:52:24,297 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 07:52:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:24,297 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 07:52:24,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 07:52:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:24,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:24,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:24,327 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 07:52:24,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:24,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507338453] [2019-12-27 07:52:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:24,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507338453] [2019-12-27 07:52:24,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:24,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:24,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594949425] [2019-12-27 07:52:24,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:24,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:24,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:24,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:24,413 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 07:52:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:24,911 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 07:52:24,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:52:24,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:24,976 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 07:52:24,976 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 07:52:24,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:52:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 07:52:25,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 07:52:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 07:52:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 07:52:25,492 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 07:52:25,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:25,493 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 07:52:25,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 07:52:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:25,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:25,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:25,521 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 07:52:25,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:25,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821120297] [2019-12-27 07:52:25,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:25,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821120297] [2019-12-27 07:52:25,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:25,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:25,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423086953] [2019-12-27 07:52:25,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:25,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:25,614 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 07:52:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:26,290 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 07:52:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:52:26,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:26,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:26,410 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 07:52:26,410 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 07:52:26,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:52:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 07:52:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 07:52:27,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 07:52:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 07:52:27,268 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 07:52:27,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:27,269 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 07:52:27,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 07:52:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:27,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:27,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:27,302 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 07:52:27,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:27,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683592566] [2019-12-27 07:52:27,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:27,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683592566] [2019-12-27 07:52:27,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:27,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:27,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172010824] [2019-12-27 07:52:27,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:27,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:27,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:27,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:27,401 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 07:52:27,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:27,899 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 07:52:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:52:27,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:27,981 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 07:52:27,981 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 07:52:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:52:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 07:52:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 07:52:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 07:52:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 07:52:28,604 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 07:52:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:28,604 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 07:52:28,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 07:52:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:28,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:28,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:28,636 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 07:52:28,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:28,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844233518] [2019-12-27 07:52:28,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:28,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844233518] [2019-12-27 07:52:28,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:28,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:28,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940316491] [2019-12-27 07:52:28,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:28,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:28,697 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 07:52:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:28,903 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 07:52:28,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:28,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:52:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:28,975 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 07:52:28,975 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 07:52:28,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 07:52:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 07:52:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 07:52:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 07:52:29,832 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 07:52:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:29,832 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 07:52:29,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 07:52:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:29,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:29,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:29,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 07:52:29,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:29,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133553203] [2019-12-27 07:52:29,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:29,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133553203] [2019-12-27 07:52:29,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:29,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:29,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897353905] [2019-12-27 07:52:29,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:29,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:29,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:29,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:29,933 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 07:52:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:30,195 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 07:52:30,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:30,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:52:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:30,251 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 07:52:30,251 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 07:52:30,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 07:52:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 07:52:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 07:52:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 07:52:30,801 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 07:52:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:30,801 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 07:52:30,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 07:52:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:30,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:30,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:30,835 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 07:52:30,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:30,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123684981] [2019-12-27 07:52:30,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:30,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-27 07:52:30,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123684981] [2019-12-27 07:52:30,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:30,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:30,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053745748] [2019-12-27 07:52:30,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:30,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:30,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:30,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:30,892 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 07:52:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:31,432 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 07:52:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:31,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:52:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:31,563 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 07:52:31,563 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 07:52:31,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 07:52:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 07:52:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 07:52:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 07:52:32,573 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 07:52:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:32,573 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 07:52:32,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 07:52:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:32,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:32,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:32,609 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 07:52:32,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:32,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713466818] [2019-12-27 07:52:32,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:32,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713466818] [2019-12-27 07:52:32,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:32,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:32,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828218730] [2019-12-27 07:52:32,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:32,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:32,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:32,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:32,683 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 07:52:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:33,445 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 07:52:33,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:52:33,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:52:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:33,549 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 07:52:33,550 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 07:52:33,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:52:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 07:52:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 07:52:34,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 07:52:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 07:52:34,320 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 07:52:34,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:34,320 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 07:52:34,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 07:52:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:34,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:34,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:34,358 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:34,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 07:52:34,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:34,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123354707] [2019-12-27 07:52:34,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:34,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123354707] [2019-12-27 07:52:34,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:34,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:34,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117735116] [2019-12-27 07:52:34,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:34,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:34,450 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 6 states. [2019-12-27 07:52:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:35,284 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 07:52:35,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:52:35,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:52:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:35,373 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 07:52:35,373 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 07:52:35,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:52:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 07:52:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 07:52:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 07:52:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 07:52:36,086 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 07:52:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:36,086 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 07:52:36,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 07:52:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:36,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:36,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:36,135 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 07:52:36,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:36,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101280552] [2019-12-27 07:52:36,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:36,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101280552] [2019-12-27 07:52:36,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:36,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:36,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687322337] [2019-12-27 07:52:36,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:36,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:36,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:36,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:36,204 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 07:52:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:37,066 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 07:52:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:52:37,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:52:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:37,141 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 07:52:37,142 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 07:52:37,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 07:52:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 07:52:37,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 07:52:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 07:52:37,809 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 07:52:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:37,810 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 07:52:37,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 07:52:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:37,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:37,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:37,855 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 07:52:37,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:37,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832775924] [2019-12-27 07:52:37,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:37,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832775924] [2019-12-27 07:52:37,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:37,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:52:37,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426213024] [2019-12-27 07:52:37,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:52:37,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:52:37,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:52:37,994 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 8 states. [2019-12-27 07:52:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:39,478 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-27 07:52:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:52:39,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 07:52:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:39,577 INFO L225 Difference]: With dead ends: 59625 [2019-12-27 07:52:39,577 INFO L226 Difference]: Without dead ends: 59513 [2019-12-27 07:52:39,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:52:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-27 07:52:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-27 07:52:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-27 07:52:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-27 07:52:40,371 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-27 07:52:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:40,372 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-27 07:52:40,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:52:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-27 07:52:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:40,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:40,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:40,418 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 07:52:40,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:40,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136636057] [2019-12-27 07:52:40,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136636057] [2019-12-27 07:52:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:41,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:52:41,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541666253] [2019-12-27 07:52:41,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:52:41,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:52:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:52:41,011 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 11 states. [2019-12-27 07:52:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:43,872 INFO L93 Difference]: Finished difference Result 62465 states and 190835 transitions. [2019-12-27 07:52:43,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 07:52:43,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 07:52:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:43,970 INFO L225 Difference]: With dead ends: 62465 [2019-12-27 07:52:43,970 INFO L226 Difference]: Without dead ends: 62169 [2019-12-27 07:52:43,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 07:52:44,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62169 states. [2019-12-27 07:52:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62169 to 44129. [2019-12-27 07:52:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44129 states. [2019-12-27 07:52:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44129 states to 44129 states and 136879 transitions. [2019-12-27 07:52:44,817 INFO L78 Accepts]: Start accepts. Automaton has 44129 states and 136879 transitions. Word has length 65 [2019-12-27 07:52:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:44,817 INFO L462 AbstractCegarLoop]: Abstraction has 44129 states and 136879 transitions. [2019-12-27 07:52:44,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:52:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 44129 states and 136879 transitions. [2019-12-27 07:52:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:44,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:44,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:44,866 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 07:52:44,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:44,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765192636] [2019-12-27 07:52:44,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:44,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765192636] [2019-12-27 07:52:44,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:44,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:44,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301752033] [2019-12-27 07:52:44,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:44,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:44,922 INFO L87 Difference]: Start difference. First operand 44129 states and 136879 transitions. Second operand 3 states. [2019-12-27 07:52:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:45,052 INFO L93 Difference]: Finished difference Result 33725 states and 103346 transitions. [2019-12-27 07:52:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:45,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:52:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:45,100 INFO L225 Difference]: With dead ends: 33725 [2019-12-27 07:52:45,100 INFO L226 Difference]: Without dead ends: 33725 [2019-12-27 07:52:45,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33725 states. [2019-12-27 07:52:45,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33725 to 32631. [2019-12-27 07:52:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32631 states. [2019-12-27 07:52:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32631 states to 32631 states and 99826 transitions. [2019-12-27 07:52:45,620 INFO L78 Accepts]: Start accepts. Automaton has 32631 states and 99826 transitions. Word has length 65 [2019-12-27 07:52:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:45,621 INFO L462 AbstractCegarLoop]: Abstraction has 32631 states and 99826 transitions. [2019-12-27 07:52:45,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 32631 states and 99826 transitions. [2019-12-27 07:52:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:45,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:45,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:45,662 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 199812966, now seen corresponding path program 1 times [2019-12-27 07:52:45,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:45,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001575442] [2019-12-27 07:52:45,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:46,134 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 5 [2019-12-27 07:52:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:46,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001575442] [2019-12-27 07:52:46,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:46,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:52:46,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066997860] [2019-12-27 07:52:46,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:52:46,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:52:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:52:46,150 INFO L87 Difference]: Start difference. First operand 32631 states and 99826 transitions. Second operand 11 states. [2019-12-27 07:52:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:49,412 INFO L93 Difference]: Finished difference Result 49103 states and 146830 transitions. [2019-12-27 07:52:49,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 07:52:49,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 07:52:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:49,483 INFO L225 Difference]: With dead ends: 49103 [2019-12-27 07:52:49,483 INFO L226 Difference]: Without dead ends: 49103 [2019-12-27 07:52:49,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 07:52:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49103 states. [2019-12-27 07:52:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49103 to 31328. [2019-12-27 07:52:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31328 states. [2019-12-27 07:52:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31328 states to 31328 states and 96150 transitions. [2019-12-27 07:52:50,091 INFO L78 Accepts]: Start accepts. Automaton has 31328 states and 96150 transitions. Word has length 66 [2019-12-27 07:52:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:50,091 INFO L462 AbstractCegarLoop]: Abstraction has 31328 states and 96150 transitions. [2019-12-27 07:52:50,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:52:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 31328 states and 96150 transitions. [2019-12-27 07:52:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:50,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:50,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:50,127 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:50,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1661859062, now seen corresponding path program 1 times [2019-12-27 07:52:50,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:50,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898158809] [2019-12-27 07:52:50,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:50,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898158809] [2019-12-27 07:52:50,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:50,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:52:50,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073390267] [2019-12-27 07:52:50,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:52:50,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:52:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:52:50,251 INFO L87 Difference]: Start difference. First operand 31328 states and 96150 transitions. Second operand 9 states. [2019-12-27 07:52:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:51,866 INFO L93 Difference]: Finished difference Result 57701 states and 175409 transitions. [2019-12-27 07:52:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:52:51,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 07:52:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:51,933 INFO L225 Difference]: With dead ends: 57701 [2019-12-27 07:52:51,933 INFO L226 Difference]: Without dead ends: 44664 [2019-12-27 07:52:51,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:52:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44664 states. [2019-12-27 07:52:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44664 to 32096. [2019-12-27 07:52:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32096 states. [2019-12-27 07:52:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32096 states to 32096 states and 97692 transitions. [2019-12-27 07:52:52,909 INFO L78 Accepts]: Start accepts. Automaton has 32096 states and 97692 transitions. Word has length 66 [2019-12-27 07:52:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:52,910 INFO L462 AbstractCegarLoop]: Abstraction has 32096 states and 97692 transitions. [2019-12-27 07:52:52,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:52:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 32096 states and 97692 transitions. [2019-12-27 07:52:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:52,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:52,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:52,946 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1990266554, now seen corresponding path program 2 times [2019-12-27 07:52:52,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:52,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879321233] [2019-12-27 07:52:52,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:53,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879321233] [2019-12-27 07:52:53,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:53,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:53,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085732820] [2019-12-27 07:52:53,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:53,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:53,005 INFO L87 Difference]: Start difference. First operand 32096 states and 97692 transitions. Second operand 4 states. [2019-12-27 07:52:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:53,183 INFO L93 Difference]: Finished difference Result 32096 states and 97405 transitions. [2019-12-27 07:52:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:53,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 07:52:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:53,228 INFO L225 Difference]: With dead ends: 32096 [2019-12-27 07:52:53,228 INFO L226 Difference]: Without dead ends: 32096 [2019-12-27 07:52:53,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:53,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32096 states. [2019-12-27 07:52:53,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32096 to 28461. [2019-12-27 07:52:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 07:52:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 85853 transitions. [2019-12-27 07:52:53,667 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 85853 transitions. Word has length 66 [2019-12-27 07:52:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:53,667 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 85853 transitions. [2019-12-27 07:52:53,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 85853 transitions. [2019-12-27 07:52:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:53,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:53,696 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:53,696 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash -855039682, now seen corresponding path program 2 times [2019-12-27 07:52:53,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:53,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120375428] [2019-12-27 07:52:53,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:53,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120375428] [2019-12-27 07:52:53,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:53,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:52:53,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777808728] [2019-12-27 07:52:53,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:52:53,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:52:53,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:52:53,860 INFO L87 Difference]: Start difference. First operand 28461 states and 85853 transitions. Second operand 11 states. [2019-12-27 07:52:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:55,202 INFO L93 Difference]: Finished difference Result 62794 states and 188209 transitions. [2019-12-27 07:52:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:52:55,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 07:52:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:55,272 INFO L225 Difference]: With dead ends: 62794 [2019-12-27 07:52:55,272 INFO L226 Difference]: Without dead ends: 48997 [2019-12-27 07:52:55,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 07:52:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48997 states. [2019-12-27 07:52:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48997 to 27235. [2019-12-27 07:52:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27235 states. [2019-12-27 07:52:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27235 states to 27235 states and 82022 transitions. [2019-12-27 07:52:55,839 INFO L78 Accepts]: Start accepts. Automaton has 27235 states and 82022 transitions. Word has length 66 [2019-12-27 07:52:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:55,839 INFO L462 AbstractCegarLoop]: Abstraction has 27235 states and 82022 transitions. [2019-12-27 07:52:55,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:52:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27235 states and 82022 transitions. [2019-12-27 07:52:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:55,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:55,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:55,870 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -503134108, now seen corresponding path program 3 times [2019-12-27 07:52:55,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:55,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649245583] [2019-12-27 07:52:55,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:52:56,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649245583] [2019-12-27 07:52:56,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:56,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 07:52:56,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598728118] [2019-12-27 07:52:56,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:52:56,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:56,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:52:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:52:56,145 INFO L87 Difference]: Start difference. First operand 27235 states and 82022 transitions. Second operand 12 states. [2019-12-27 07:53:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:00,392 INFO L93 Difference]: Finished difference Result 56256 states and 167408 transitions. [2019-12-27 07:53:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 07:53:00,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 07:53:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:00,472 INFO L225 Difference]: With dead ends: 56256 [2019-12-27 07:53:00,472 INFO L226 Difference]: Without dead ends: 56088 [2019-12-27 07:53:00,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=341, Invalid=1551, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 07:53:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56088 states. [2019-12-27 07:53:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56088 to 30967. [2019-12-27 07:53:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30967 states. [2019-12-27 07:53:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30967 states to 30967 states and 93410 transitions. [2019-12-27 07:53:01,117 INFO L78 Accepts]: Start accepts. Automaton has 30967 states and 93410 transitions. Word has length 66 [2019-12-27 07:53:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:01,117 INFO L462 AbstractCegarLoop]: Abstraction has 30967 states and 93410 transitions. [2019-12-27 07:53:01,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:53:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 30967 states and 93410 transitions. [2019-12-27 07:53:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:53:01,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:01,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:01,152 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:01,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:01,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1809198528, now seen corresponding path program 4 times [2019-12-27 07:53:01,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:01,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652377323] [2019-12-27 07:53:01,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:53:01,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652377323] [2019-12-27 07:53:01,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:01,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:01,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125212439] [2019-12-27 07:53:01,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:01,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:01,225 INFO L87 Difference]: Start difference. First operand 30967 states and 93410 transitions. Second operand 3 states. [2019-12-27 07:53:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:01,355 INFO L93 Difference]: Finished difference Result 30967 states and 93409 transitions. [2019-12-27 07:53:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:01,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:53:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:01,419 INFO L225 Difference]: With dead ends: 30967 [2019-12-27 07:53:01,419 INFO L226 Difference]: Without dead ends: 30967 [2019-12-27 07:53:01,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30967 states. [2019-12-27 07:53:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30967 to 25062. [2019-12-27 07:53:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25062 states. [2019-12-27 07:53:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25062 states to 25062 states and 76759 transitions. [2019-12-27 07:53:02,144 INFO L78 Accepts]: Start accepts. Automaton has 25062 states and 76759 transitions. Word has length 66 [2019-12-27 07:53:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:02,145 INFO L462 AbstractCegarLoop]: Abstraction has 25062 states and 76759 transitions. [2019-12-27 07:53:02,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 25062 states and 76759 transitions. [2019-12-27 07:53:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:02,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:02,173 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 1 times [2019-12-27 07:53:02,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:02,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018368186] [2019-12-27 07:53:02,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:53:02,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018368186] [2019-12-27 07:53:02,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:02,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:53:02,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009625097] [2019-12-27 07:53:02,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:53:02,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:02,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:53:02,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:53:02,394 INFO L87 Difference]: Start difference. First operand 25062 states and 76759 transitions. Second operand 12 states. [2019-12-27 07:53:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:03,382 INFO L93 Difference]: Finished difference Result 39642 states and 121101 transitions. [2019-12-27 07:53:03,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:53:03,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 07:53:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:03,440 INFO L225 Difference]: With dead ends: 39642 [2019-12-27 07:53:03,440 INFO L226 Difference]: Without dead ends: 39213 [2019-12-27 07:53:03,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 07:53:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39213 states. [2019-12-27 07:53:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39213 to 24808. [2019-12-27 07:53:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24808 states. [2019-12-27 07:53:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24808 states to 24808 states and 76111 transitions. [2019-12-27 07:53:03,910 INFO L78 Accepts]: Start accepts. Automaton has 24808 states and 76111 transitions. Word has length 67 [2019-12-27 07:53:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:03,911 INFO L462 AbstractCegarLoop]: Abstraction has 24808 states and 76111 transitions. [2019-12-27 07:53:03,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:53:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 24808 states and 76111 transitions. [2019-12-27 07:53:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:03,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:03,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:03,936 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 2 times [2019-12-27 07:53:03,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:03,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573724326] [2019-12-27 07:53:03,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:53:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:53:04,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:53:04,063 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:53:04,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_23|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2281~0.base_23| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (= |v_ULTIMATE.start_main_~#t2281~0.offset_17| 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_23| 1)) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_23|) |v_ULTIMATE.start_main_~#t2281~0.offset_17| 0))) (= 0 v_~z$r_buff1_thd1~0_16) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2281~0.base_23|) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_18|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ULTIMATE.start_main_~#t2281~0.offset=|v_ULTIMATE.start_main_~#t2281~0.offset_17|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t2281~0.base=|v_ULTIMATE.start_main_~#t2281~0.base_23|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2283~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2281~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2281~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2283~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2282~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 07:53:04,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2282~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2282~0.base_9| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9|) |v_ULTIMATE.start_main_~#t2282~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2282~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2282~0.offset, #length] because there is no mapped edge [2019-12-27 07:53:04,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out432206974 ~z$w_buff0~0_In432206974) (= P0Thread1of1ForFork0_~arg.base_Out432206974 |P0Thread1of1ForFork0_#in~arg.base_In432206974|) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out432206974| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out432206974) (= ~z$w_buff0~0_Out432206974 1) (= |P0Thread1of1ForFork0_#in~arg.offset_In432206974| P0Thread1of1ForFork0_~arg.offset_Out432206974) (= 1 ~z$w_buff0_used~0_Out432206974) (= 0 (mod ~z$w_buff1_used~0_Out432206974 256)) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out432206974|) (= ~z$w_buff0_used~0_In432206974 ~z$w_buff1_used~0_Out432206974)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In432206974|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In432206974, ~z$w_buff0~0=~z$w_buff0~0_In432206974, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In432206974|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In432206974|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out432206974, ~z$w_buff0~0=~z$w_buff0~0_Out432206974, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out432206974, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out432206974, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In432206974|, ~z$w_buff1~0=~z$w_buff1~0_Out432206974, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out432206974, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out432206974|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out432206974} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 07:53:04,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2283~0.offset_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11|) |v_ULTIMATE.start_main_~#t2283~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2283~0.base_11| 0)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2283~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2283~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2283~0.offset, #length, ULTIMATE.start_main_~#t2283~0.base] because there is no mapped edge [2019-12-27 07:53:04,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1129498639 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1129498639 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1129498639| |P1Thread1of1ForFork1_#t~ite10_Out-1129498639|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1129498639| ~z~0_In-1129498639) (or .cse0 .cse1) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1129498639| ~z$w_buff1~0_In-1129498639) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1129498639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1129498639, ~z$w_buff1~0=~z$w_buff1~0_In-1129498639, ~z~0=~z~0_In-1129498639} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1129498639|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1129498639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1129498639, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1129498639|, ~z$w_buff1~0=~z$w_buff1~0_In-1129498639, ~z~0=~z~0_In-1129498639} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 07:53:04,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1108306445 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1108306445 256) 0))) (or (and (= ~z$w_buff0_used~0_In1108306445 |P1Thread1of1ForFork1_#t~ite11_Out1108306445|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1108306445|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1108306445} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1108306445, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1108306445|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1108306445} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:53:04,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1529090080 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1529090080 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1529090080 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1529090080 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1529090080 |P1Thread1of1ForFork1_#t~ite12_Out1529090080|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1529090080|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1529090080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1529090080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1529090080, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1529090080} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1529090080, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1529090080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1529090080, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1529090080|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1529090080} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:53:04,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1514184354 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1514184354 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1514184354| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In1514184354 |P1Thread1of1ForFork1_#t~ite13_Out1514184354|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1514184354, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1514184354} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1514184354, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1514184354|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1514184354} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:53:04,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1004103431 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out-1004103431| |P2Thread1of1ForFork2_#t~ite23_Out-1004103431|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1004103431 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1004103431 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-1004103431 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1004103431 256)))) (= |P2Thread1of1ForFork2_#t~ite23_Out-1004103431| ~z$w_buff1~0_In-1004103431)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out-1004103431| ~z$w_buff1~0_In-1004103431) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-1004103431| |P2Thread1of1ForFork2_#t~ite23_Out-1004103431|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1004103431|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1004103431, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1004103431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1004103431, ~z$w_buff1~0=~z$w_buff1~0_In-1004103431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1004103431, ~weak$$choice2~0=~weak$$choice2~0_In-1004103431} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1004103431|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1004103431|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1004103431, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1004103431, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1004103431, ~z$w_buff1~0=~z$w_buff1~0_In-1004103431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1004103431, ~weak$$choice2~0=~weak$$choice2~0_In-1004103431} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 07:53:04,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1645016635 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out1645016635| ~z$w_buff0_used~0_In1645016635) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1645016635 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1645016635 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1645016635 256))) (and (= 0 (mod ~z$w_buff1_used~0_In1645016635 256)) .cse0))) (= |P2Thread1of1ForFork2_#t~ite26_Out1645016635| |P2Thread1of1ForFork2_#t~ite27_Out1645016635|) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite26_In1645016635| |P2Thread1of1ForFork2_#t~ite26_Out1645016635|) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite27_Out1645016635| ~z$w_buff0_used~0_In1645016635)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1645016635|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645016635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1645016635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645016635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1645016635, ~weak$$choice2~0=~weak$$choice2~0_In1645016635} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1645016635|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1645016635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1645016635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1645016635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1645016635, ~weak$$choice2~0=~weak$$choice2~0_In1645016635, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1645016635|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 07:53:04,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1531170260 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1531170260 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1531170260 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1531170260 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1531170260|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1531170260 |P1Thread1of1ForFork1_#t~ite14_Out-1531170260|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1531170260, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1531170260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1531170260, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1531170260} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1531170260, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1531170260, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1531170260, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1531170260|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1531170260} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:53:04,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:53:04,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-884367973 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In-884367973| |P2Thread1of1ForFork2_#t~ite29_Out-884367973|) (= ~z$w_buff1_used~0_In-884367973 |P2Thread1of1ForFork2_#t~ite30_Out-884367973|) (not .cse0)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-884367973 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-884367973 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-884367973 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-884367973 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite29_Out-884367973| ~z$w_buff1_used~0_In-884367973) (= |P2Thread1of1ForFork2_#t~ite29_Out-884367973| |P2Thread1of1ForFork2_#t~ite30_Out-884367973|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-884367973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884367973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-884367973, ~weak$$choice2~0=~weak$$choice2~0_In-884367973, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-884367973|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-884367973|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-884367973, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-884367973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-884367973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-884367973, ~weak$$choice2~0=~weak$$choice2~0_In-884367973, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-884367973|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 07:53:04,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 07:53:04,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 07:53:04,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1050771076 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1050771076 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1050771076| ~z$w_buff0_used~0_In-1050771076)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1050771076| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050771076, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1050771076} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1050771076|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050771076, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1050771076} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:53:04,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-561661774 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-561661774 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-561661774 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-561661774 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-561661774|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-561661774 |P0Thread1of1ForFork0_#t~ite6_Out-561661774|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-561661774, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-561661774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-561661774, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-561661774} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-561661774|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-561661774, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-561661774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-561661774, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-561661774} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:53:04,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1333537956 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1333537956 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1333537956 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out1333537956 ~z$r_buff0_thd1~0_In1333537956)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333537956, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1333537956} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1333537956, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1333537956|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1333537956} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:53:04,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1009272203 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1009272203 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1009272203 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1009272203 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1009272203| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In1009272203 |P0Thread1of1ForFork0_#t~ite8_Out1009272203|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1009272203, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009272203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009272203, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009272203} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1009272203, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1009272203|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1009272203, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1009272203, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1009272203} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:53:04,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:53:04,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In876113550 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out876113550| |P2Thread1of1ForFork2_#t~ite39_Out876113550|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In876113550 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out876113550| ~z~0_In876113550)) (and (not .cse1) .cse2 (= |P2Thread1of1ForFork2_#t~ite38_Out876113550| ~z$w_buff1~0_In876113550) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In876113550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876113550, ~z$w_buff1~0=~z$w_buff1~0_In876113550, ~z~0=~z~0_In876113550} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In876113550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In876113550, ~z$w_buff1~0=~z$w_buff1~0_In876113550, ~z~0=~z~0_In876113550, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out876113550|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out876113550|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 07:53:04,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In855560773 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In855560773 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out855560773| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out855560773| ~z$w_buff0_used~0_In855560773) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In855560773, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In855560773} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In855560773, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In855560773, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out855560773|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 07:53:04,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-2015684966 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2015684966 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-2015684966 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2015684966 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out-2015684966|)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out-2015684966| ~z$w_buff1_used~0_In-2015684966) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015684966, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2015684966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015684966, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2015684966} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-2015684966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2015684966, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2015684966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2015684966, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2015684966} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 07:53:04,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-948688217 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-948688217 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-948688217| ~z$r_buff0_thd3~0_In-948688217) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-948688217| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-948688217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-948688217} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-948688217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-948688217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-948688217} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 07:53:04,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1834009036 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1834009036 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1834009036 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1834009036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-1834009036|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1834009036 |P2Thread1of1ForFork2_#t~ite43_Out-1834009036|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834009036, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834009036, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834009036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834009036} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834009036, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834009036, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1834009036|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834009036, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834009036} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 07:53:04,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:53:04,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:53:04,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-207890885| |ULTIMATE.start_main_#t~ite48_Out-207890885|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-207890885 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-207890885 256)))) (or (and .cse0 (= ~z~0_In-207890885 |ULTIMATE.start_main_#t~ite47_Out-207890885|) (or .cse1 .cse2)) (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-207890885| ~z$w_buff1~0_In-207890885) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207890885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207890885, ~z$w_buff1~0=~z$w_buff1~0_In-207890885, ~z~0=~z~0_In-207890885} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-207890885, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-207890885|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-207890885, ~z$w_buff1~0=~z$w_buff1~0_In-207890885, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-207890885|, ~z~0=~z~0_In-207890885} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:53:04,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1341979980 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1341979980 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-1341979980|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1341979980 |ULTIMATE.start_main_#t~ite49_Out-1341979980|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1341979980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341979980} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1341979980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341979980, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1341979980|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:53:04,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In665518673 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In665518673 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In665518673 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In665518673 256)))) (or (and (= ~z$w_buff1_used~0_In665518673 |ULTIMATE.start_main_#t~ite50_Out665518673|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out665518673|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In665518673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In665518673, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In665518673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In665518673} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out665518673|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In665518673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In665518673, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In665518673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In665518673} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 07:53:04,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1831141688 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1831141688 256)))) (or (and (= ~z$r_buff0_thd0~0_In1831141688 |ULTIMATE.start_main_#t~ite51_Out1831141688|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1831141688| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1831141688, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1831141688} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1831141688, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1831141688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1831141688} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 07:53:04,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-522290786 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-522290786 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-522290786 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-522290786 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-522290786| ~z$r_buff1_thd0~0_In-522290786) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite52_Out-522290786| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-522290786, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-522290786, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-522290786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-522290786} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-522290786|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-522290786, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-522290786, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-522290786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-522290786} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 07:53:04,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:53:04,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:53:04 BasicIcfg [2019-12-27 07:53:04,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:53:04,207 INFO L168 Benchmark]: Toolchain (without parser) took 105314.89 ms. Allocated memory was 148.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.8 MB in the beginning and 860.6 MB in the end (delta: -756.9 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,209 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 148.4 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.46 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 103.5 MB in the beginning and 158.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.84 ms. Allocated memory is still 205.0 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,211 INFO L168 Benchmark]: Boogie Preprocessor took 37.22 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,211 INFO L168 Benchmark]: RCFGBuilder took 929.82 ms. Allocated memory is still 205.0 MB. Free memory was 153.2 MB in the beginning and 103.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,215 INFO L168 Benchmark]: TraceAbstraction took 103369.04 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.4 MB in the beginning and 860.6 MB in the end (delta: -757.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 07:53:04,218 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.19 ms. Allocated memory is still 148.4 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 897.46 ms. Allocated memory was 148.4 MB in the beginning and 205.0 MB in the end (delta: 56.6 MB). Free memory was 103.5 MB in the beginning and 158.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.84 ms. Allocated memory is still 205.0 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.22 ms. Allocated memory is still 205.0 MB. Free memory was 155.7 MB in the beginning and 153.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 929.82 ms. Allocated memory is still 205.0 MB. Free memory was 153.2 MB in the beginning and 103.4 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103369.04 ms. Allocated memory was 205.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.4 MB in the beginning and 860.6 MB in the end (delta: -757.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.0s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7635 SDtfs, 8913 SDslu, 26890 SDs, 0 SdLazy, 17697 SolverSat, 416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 73 SyntacticMatches, 29 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 355997 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1679 NumberOfCodeBlocks, 1679 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1580 ConstructedInterpolants, 0 QuantifiedInterpolants, 336090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...