/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/mix046_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:32:48,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:32:48,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:32:48,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:32:48,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:32:48,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:32:48,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:32:48,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:32:48,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:32:48,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:32:48,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:32:48,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:32:48,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:32:48,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:32:48,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:32:48,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:32:48,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:32:48,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:32:48,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:32:48,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:32:48,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:32:48,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:32:48,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:32:48,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:32:48,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:32:48,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:32:48,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:32:48,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:32:48,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:32:48,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:32:48,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:32:48,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:32:48,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:32:48,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:32:48,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:32:48,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:32:48,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:32:48,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:32:48,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:32:48,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:32:48,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:32:48,849 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-18 21:32:48,865 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:32:48,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:32:48,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:32:48,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:32:48,867 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:32:48,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:32:48,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:32:48,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:32:48,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:32:48,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:32:48,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:32:48,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:32:48,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:32:48,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:32:48,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:32:48,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:32:48,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:32:48,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:32:48,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:32:48,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:32:48,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:32:48,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:32:48,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:32:48,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:32:48,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:32:48,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:32:48,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:32:48,872 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:32:48,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:32:48,872 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:32:49,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:32:49,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:32:49,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:32:49,205 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:32:49,206 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:32:49,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2019-12-18 21:32:49,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598505191/a51eed30dbd04f879bf6946acafe3b86/FLAGd7e1ef906 [2019-12-18 21:32:49,812 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:32:49,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2019-12-18 21:32:49,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598505191/a51eed30dbd04f879bf6946acafe3b86/FLAGd7e1ef906 [2019-12-18 21:32:50,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/598505191/a51eed30dbd04f879bf6946acafe3b86 [2019-12-18 21:32:50,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:32:50,096 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:32:50,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:32:50,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:32:50,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:32:50,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50, skipping insertion in model container [2019-12-18 21:32:50,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:32:50,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:32:50,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:32:50,727 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:32:50,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:32:50,883 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:32:50,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50 WrapperNode [2019-12-18 21:32:50,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:32:50,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:32:50,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:32:50,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:32:50,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:32:50,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:32:50,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:32:50,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:32:50,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (1/1) ... [2019-12-18 21:32:50,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:32:50,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:32:50,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:32:50,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:32:50,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (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-18 21:32:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:32:51,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:32:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:32:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:32:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:32:51,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:32:51,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:32:51,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:32:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:32:51,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:32:51,083 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:32:51,083 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:32:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:32:51,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:32:51,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:32:51,086 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:32:51,894 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:32:51,895 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:32:51,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:32:51 BoogieIcfgContainer [2019-12-18 21:32:51,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:32:51,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:32:51,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:32:51,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:32:51,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:32:50" (1/3) ... [2019-12-18 21:32:51,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2574c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:32:51, skipping insertion in model container [2019-12-18 21:32:51,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:32:50" (2/3) ... [2019-12-18 21:32:51,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2574c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:32:51, skipping insertion in model container [2019-12-18 21:32:51,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:32:51" (3/3) ... [2019-12-18 21:32:51,907 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2019-12-18 21:32:51,916 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:32:51,917 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:32:51,925 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:32:51,926 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:32:51,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,979 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,979 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,981 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,981 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,994 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,995 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,996 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,022 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,023 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,024 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,024 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,024 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,024 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,034 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,039 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,039 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,042 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,043 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,043 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,044 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,044 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,045 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:32:52,060 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:32:52,080 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:32:52,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:32:52,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:32:52,081 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:32:52,081 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:32:52,081 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:32:52,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:32:52,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:32:52,099 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 21:32:52,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:32:52,188 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:32:52,189 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:32:52,206 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:32:52,229 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 21:32:52,275 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 21:32:52,275 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:32:52,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:32:52,298 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:32:52,299 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:32:55,865 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:32:56,014 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:32:56,034 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-18 21:32:56,034 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 21:32:56,038 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-18 21:32:58,619 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-18 21:32:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-18 21:32:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:32:58,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:32:58,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:32:58,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:32:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:32:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-18 21:32:58,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:32:58,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879268270] [2019-12-18 21:32:58,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:32:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:32:59,039 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-18 21:32:59,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879268270] [2019-12-18 21:32:59,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:32:59,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:32:59,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541251913] [2019-12-18 21:32:59,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:32:59,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:32:59,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:32:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:32:59,066 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-18 21:33:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:00,310 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-18 21:33:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:00,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:33:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:00,655 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 21:33:00,655 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 21:33:00,657 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-18 21:33:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 21:33:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 21:33:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 21:33:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-18 21:33:02,796 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-18 21:33:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:02,797 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-18 21:33:02,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-18 21:33:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:33:02,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:02,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:02,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-18 21:33:02,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:02,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897381548] [2019-12-18 21:33:02,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:02,961 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-18 21:33:02,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897381548] [2019-12-18 21:33:02,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:02,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:02,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801490120] [2019-12-18 21:33:02,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:33:02,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:02,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:33:02,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:33:02,964 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-18 21:33:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:05,425 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-18 21:33:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:33:05,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:33:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:05,712 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 21:33:05,712 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 21:33:05,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 21:33:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-18 21:33:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-18 21:33:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-18 21:33:08,035 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-18 21:33:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:08,036 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-18 21:33:08,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:33:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-18 21:33:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:33:08,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:08,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:08,039 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-18 21:33:08,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:08,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75914105] [2019-12-18 21:33:08,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:08,079 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-18 21:33:08,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75914105] [2019-12-18 21:33:08,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:08,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:08,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041372280] [2019-12-18 21:33:08,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:08,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:08,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:08,082 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-18 21:33:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:08,270 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-18 21:33:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:08,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:33:08,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:08,376 INFO L225 Difference]: With dead ends: 39280 [2019-12-18 21:33:08,376 INFO L226 Difference]: Without dead ends: 39280 [2019-12-18 21:33:08,377 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-18 21:33:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-18 21:33:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-18 21:33:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-18 21:33:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-18 21:33:11,548 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-18 21:33:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:11,549 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-18 21:33:11,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-18 21:33:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:33:11,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:11,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:11,552 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-18 21:33:11,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:11,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842652752] [2019-12-18 21:33:11,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:11,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842652752] [2019-12-18 21:33:11,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:11,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:33:11,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632462954] [2019-12-18 21:33:11,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:33:11,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:33:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:33:11,604 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-18 21:33:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:11,682 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-18 21:33:11,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:33:11,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:33:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:11,712 INFO L225 Difference]: With dead ends: 16344 [2019-12-18 21:33:11,712 INFO L226 Difference]: Without dead ends: 16344 [2019-12-18 21:33:11,712 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-18 21:33:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-18 21:33:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-18 21:33:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-18 21:33:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-18 21:33:12,352 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-18 21:33:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:12,352 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-18 21:33:12,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:33:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-18 21:33:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:33:12,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:12,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:12,360 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-18 21:33:12,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:12,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188130527] [2019-12-18 21:33:12,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:12,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188130527] [2019-12-18 21:33:12,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:12,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:33:12,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936554964] [2019-12-18 21:33:12,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:33:12,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:12,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:33:12,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:12,415 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-18 21:33:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:12,458 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-18 21:33:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:33:12,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:33:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:12,462 INFO L225 Difference]: With dead ends: 2799 [2019-12-18 21:33:12,462 INFO L226 Difference]: Without dead ends: 2799 [2019-12-18 21:33:12,463 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-18 21:33:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-18 21:33:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-18 21:33:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-18 21:33:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-18 21:33:12,498 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-18 21:33:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:12,498 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-18 21:33:12,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:33:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-18 21:33:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:33:12,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:12,503 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] [2019-12-18 21:33:12,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-18 21:33:12,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:12,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48073835] [2019-12-18 21:33:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:33:12,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48073835] [2019-12-18 21:33:12,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:12,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:33:12,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713575735] [2019-12-18 21:33:12,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:33:12,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:12,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:33:12,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:12,588 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-18 21:33:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:12,634 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-18 21:33:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:33:12,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:33:12,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:12,637 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 21:33:12,638 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 21:33:12,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:12,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 21:33:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 21:33:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 21:33:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-18 21:33:12,658 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-18 21:33:12,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:12,658 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-18 21:33:12,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:33:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-18 21:33:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:12,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:12,667 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] [2019-12-18 21:33:12,667 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-18 21:33:12,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:12,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791161895] [2019-12-18 21:33:12,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:12,779 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-18 21:33:12,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791161895] [2019-12-18 21:33:12,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:12,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:33:12,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712148712] [2019-12-18 21:33:12,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:12,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:12,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:12,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:12,782 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-18 21:33:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:12,832 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-18 21:33:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:12,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:33:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:12,837 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 21:33:12,837 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 21:33:12,837 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-18 21:33:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 21:33:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 21:33:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 21:33:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-18 21:33:12,858 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-18 21:33:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:12,860 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-18 21:33:12,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-18 21:33:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:12,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:12,865 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] [2019-12-18 21:33:12,865 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-18 21:33:12,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:12,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915402685] [2019-12-18 21:33:12,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:13,020 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-18 21:33:13,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915402685] [2019-12-18 21:33:13,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:13,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:33:13,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522158997] [2019-12-18 21:33:13,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:33:13,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:13,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:33:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:13,023 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-18 21:33:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:13,248 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-18 21:33:13,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:33:13,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:33:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:13,253 INFO L225 Difference]: With dead ends: 1763 [2019-12-18 21:33:13,253 INFO L226 Difference]: Without dead ends: 1763 [2019-12-18 21:33:13,253 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-18 21:33:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-18 21:33:13,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-18 21:33:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-18 21:33:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-18 21:33:13,274 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-18 21:33:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:13,274 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-18 21:33:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:33:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-18 21:33:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:13,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:13,278 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] [2019-12-18 21:33:13,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-18 21:33:13,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:13,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626450616] [2019-12-18 21:33:13,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:13,383 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-18 21:33:13,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626450616] [2019-12-18 21:33:13,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:13,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:33:13,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887763048] [2019-12-18 21:33:13,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:33:13,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:13,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:33:13,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:33:13,386 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-18 21:33:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:13,757 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-18 21:33:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:33:13,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 21:33:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:13,764 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 21:33:13,764 INFO L226 Difference]: Without dead ends: 2369 [2019-12-18 21:33:13,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:33:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-18 21:33:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-18 21:33:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-18 21:33:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-18 21:33:13,795 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-18 21:33:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:13,796 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-18 21:33:13,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:33:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-18 21:33:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:33:13,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:13,800 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] [2019-12-18 21:33:13,800 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-18 21:33:13,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:13,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199254535] [2019-12-18 21:33:13,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:13,962 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-18 21:33:13,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199254535] [2019-12-18 21:33:13,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:13,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:13,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650598238] [2019-12-18 21:33:13,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:13,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:13,964 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 3 states. [2019-12-18 21:33:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:14,020 INFO L93 Difference]: Finished difference Result 1501 states and 4319 transitions. [2019-12-18 21:33:14,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:14,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:33:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:14,024 INFO L225 Difference]: With dead ends: 1501 [2019-12-18 21:33:14,024 INFO L226 Difference]: Without dead ends: 1501 [2019-12-18 21:33:14,025 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-18 21:33:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-12-18 21:33:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1080. [2019-12-18 21:33:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-12-18 21:33:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3133 transitions. [2019-12-18 21:33:14,038 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 3133 transitions. Word has length 58 [2019-12-18 21:33:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:14,038 INFO L462 AbstractCegarLoop]: Abstraction has 1080 states and 3133 transitions. [2019-12-18 21:33:14,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 3133 transitions. [2019-12-18 21:33:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:14,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:14,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:33:14,041 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash 226928645, now seen corresponding path program 1 times [2019-12-18 21:33:14,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:14,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018475304] [2019-12-18 21:33:14,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:14,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-18 21:33:14,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018475304] [2019-12-18 21:33:14,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:14,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:33:14,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558961653] [2019-12-18 21:33:14,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:33:14,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:14,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:33:14,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:33:14,225 INFO L87 Difference]: Start difference. First operand 1080 states and 3133 transitions. Second operand 7 states. [2019-12-18 21:33:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:14,428 INFO L93 Difference]: Finished difference Result 2134 states and 5841 transitions. [2019-12-18 21:33:14,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:33:14,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 21:33:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:14,433 INFO L225 Difference]: With dead ends: 2134 [2019-12-18 21:33:14,434 INFO L226 Difference]: Without dead ends: 1496 [2019-12-18 21:33:14,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:33:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-12-18 21:33:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 950. [2019-12-18 21:33:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-18 21:33:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2693 transitions. [2019-12-18 21:33:14,463 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2693 transitions. Word has length 59 [2019-12-18 21:33:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2693 transitions. [2019-12-18 21:33:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:33:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2693 transitions. [2019-12-18 21:33:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:14,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:14,466 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] [2019-12-18 21:33:14,466 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:14,467 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 2 times [2019-12-18 21:33:14,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:14,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555900342] [2019-12-18 21:33:14,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:14,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-18 21:33:14,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555900342] [2019-12-18 21:33:14,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:14,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:33:14,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11055687] [2019-12-18 21:33:14,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:33:14,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:14,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:33:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:33:14,684 INFO L87 Difference]: Start difference. First operand 950 states and 2693 transitions. Second operand 7 states. [2019-12-18 21:33:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:14,884 INFO L93 Difference]: Finished difference Result 1714 states and 4565 transitions. [2019-12-18 21:33:14,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:33:14,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-18 21:33:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:14,888 INFO L225 Difference]: With dead ends: 1714 [2019-12-18 21:33:14,888 INFO L226 Difference]: Without dead ends: 981 [2019-12-18 21:33:14,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:33:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-12-18 21:33:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 693. [2019-12-18 21:33:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-12-18 21:33:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1734 transitions. [2019-12-18 21:33:14,903 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1734 transitions. Word has length 59 [2019-12-18 21:33:14,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:14,903 INFO L462 AbstractCegarLoop]: Abstraction has 693 states and 1734 transitions. [2019-12-18 21:33:14,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:33:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1734 transitions. [2019-12-18 21:33:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:14,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:14,907 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] [2019-12-18 21:33:14,907 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash -983573057, now seen corresponding path program 3 times [2019-12-18 21:33:14,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:14,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461360675] [2019-12-18 21:33:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:15,486 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 21:33:15,517 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-18 21:33:15,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461360675] [2019-12-18 21:33:15,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:15,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:33:15,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398902094] [2019-12-18 21:33:15,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:33:15,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:33:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:33:15,519 INFO L87 Difference]: Start difference. First operand 693 states and 1734 transitions. Second operand 5 states. [2019-12-18 21:33:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:15,564 INFO L93 Difference]: Finished difference Result 911 states and 2142 transitions. [2019-12-18 21:33:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:33:15,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-18 21:33:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:15,566 INFO L225 Difference]: With dead ends: 911 [2019-12-18 21:33:15,566 INFO L226 Difference]: Without dead ends: 289 [2019-12-18 21:33:15,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:33:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-18 21:33:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-12-18 21:33:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-18 21:33:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 536 transitions. [2019-12-18 21:33:15,571 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 536 transitions. Word has length 59 [2019-12-18 21:33:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:15,571 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 536 transitions. [2019-12-18 21:33:15,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:33:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 536 transitions. [2019-12-18 21:33:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:33:15,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:15,572 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] [2019-12-18 21:33:15,572 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:15,573 INFO L82 PathProgramCache]: Analyzing trace with hash 851087049, now seen corresponding path program 4 times [2019-12-18 21:33:15,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:15,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156654459] [2019-12-18 21:33:15,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:15,653 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-18 21:33:15,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156654459] [2019-12-18 21:33:15,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:15,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:33:15,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260278362] [2019-12-18 21:33:15,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:33:15,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:33:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:33:15,655 INFO L87 Difference]: Start difference. First operand 289 states and 536 transitions. Second operand 3 states. [2019-12-18 21:33:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:15,666 INFO L93 Difference]: Finished difference Result 268 states and 479 transitions. [2019-12-18 21:33:15,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:33:15,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:33:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:15,667 INFO L225 Difference]: With dead ends: 268 [2019-12-18 21:33:15,667 INFO L226 Difference]: Without dead ends: 268 [2019-12-18 21:33:15,667 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-18 21:33:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-18 21:33:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2019-12-18 21:33:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-18 21:33:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-18 21:33:15,672 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 59 [2019-12-18 21:33:15,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:15,673 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-18 21:33:15,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:33:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-18 21:33:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:33:15,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:15,679 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] [2019-12-18 21:33:15,679 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:15,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 1 times [2019-12-18 21:33:15,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:15,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445943095] [2019-12-18 21:33:15,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:33:16,025 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-18 21:33:16,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445943095] [2019-12-18 21:33:16,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:33:16,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:33:16,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777581595] [2019-12-18 21:33:16,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:33:16,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:33:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:33:16,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:33:16,027 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 12 states. [2019-12-18 21:33:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:33:16,341 INFO L93 Difference]: Finished difference Result 393 states and 681 transitions. [2019-12-18 21:33:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:33:16,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:33:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:33:16,342 INFO L225 Difference]: With dead ends: 393 [2019-12-18 21:33:16,342 INFO L226 Difference]: Without dead ends: 362 [2019-12-18 21:33:16,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:33:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-12-18 21:33:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 344. [2019-12-18 21:33:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 21:33:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-18 21:33:16,347 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-18 21:33:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:33:16,347 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-18 21:33:16,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:33:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-18 21:33:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:33:16,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:33:16,348 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] [2019-12-18 21:33:16,348 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:33:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:33:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 2 times [2019-12-18 21:33:16,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:33:16,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799961051] [2019-12-18 21:33:16,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:33:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:33:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:33:16,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:33:16,521 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:33:16,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= |v_ULTIMATE.start_main_~#t1237~0.offset_16| 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1237~0.base_19| 1)) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1237~0.base_19| 4)) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1237~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1237~0.base_19|) |v_ULTIMATE.start_main_~#t1237~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1237~0.base_19|)) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1237~0.base_19|) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_~#t1240~0.offset=|v_ULTIMATE.start_main_~#t1240~0.offset_17|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_~#t1240~0.base=|v_ULTIMATE.start_main_~#t1240~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~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_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_11, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ULTIMATE.start_main_~#t1239~0.base=|v_ULTIMATE.start_main_~#t1239~0.base_21|, ULTIMATE.start_main_~#t1237~0.offset=|v_ULTIMATE.start_main_~#t1237~0.offset_16|, ULTIMATE.start_main_~#t1238~0.base=|v_ULTIMATE.start_main_~#t1238~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_~#t1238~0.offset=|v_ULTIMATE.start_main_~#t1238~0.offset_17|, ULTIMATE.start_main_~#t1237~0.base=|v_ULTIMATE.start_main_~#t1237~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ULTIMATE.start_main_~#t1239~0.offset=|v_ULTIMATE.start_main_~#t1239~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1240~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1240~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1239~0.base, ULTIMATE.start_main_~#t1237~0.offset, ULTIMATE.start_main_~#t1238~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1238~0.offset, ULTIMATE.start_main_~#t1237~0.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ULTIMATE.start_main_~#t1239~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:33:16,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1238~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1238~0.base_13|) |v_ULTIMATE.start_main_~#t1238~0.offset_11| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1238~0.base_13|)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1238~0.base_13| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1238~0.base_13|) (= |v_ULTIMATE.start_main_~#t1238~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1238~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1238~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1238~0.base=|v_ULTIMATE.start_main_~#t1238~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1238~0.offset=|v_ULTIMATE.start_main_~#t1238~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1238~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1238~0.offset] because there is no mapped edge [2019-12-18 21:33:16,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1239~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1239~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1239~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1239~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1239~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1239~0.base_12|) |v_ULTIMATE.start_main_~#t1239~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1239~0.base_12|) (= |v_ULTIMATE.start_main_~#t1239~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1239~0.offset=|v_ULTIMATE.start_main_~#t1239~0.offset_10|, ULTIMATE.start_main_~#t1239~0.base=|v_ULTIMATE.start_main_~#t1239~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1239~0.offset, ULTIMATE.start_main_~#t1239~0.base] because there is no mapped edge [2019-12-18 21:33:16,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1240~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1240~0.base_12|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1240~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1240~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1240~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1240~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1240~0.base_12|) |v_ULTIMATE.start_main_~#t1240~0.offset_10| 3)) |v_#memory_int_13|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1240~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1240~0.base=|v_ULTIMATE.start_main_~#t1240~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1240~0.offset=|v_ULTIMATE.start_main_~#t1240~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1240~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1240~0.offset] because there is no mapped edge [2019-12-18 21:33:16,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:33:16,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:33:16,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:33:16,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1610068086 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1610068086 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1610068086|)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out1610068086| ~z$w_buff0_used~0_In1610068086) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1610068086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1610068086} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1610068086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1610068086, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1610068086|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:33:16,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In1880125786 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1880125786 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1880125786 |P2Thread1of1ForFork2_#t~ite3_Out1880125786|)) (and (= ~z$w_buff1~0_In1880125786 |P2Thread1of1ForFork2_#t~ite3_Out1880125786|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1880125786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1880125786, ~z$w_buff1~0=~z$w_buff1~0_In1880125786, ~z~0=~z~0_In1880125786} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1880125786|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1880125786, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1880125786, ~z$w_buff1~0=~z$w_buff1~0_In1880125786, ~z~0=~z~0_In1880125786} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:33:16,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In162593046 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In162593046 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In162593046 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In162593046 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In162593046 |P3Thread1of1ForFork3_#t~ite12_Out162593046|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out162593046|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In162593046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In162593046, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In162593046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In162593046} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In162593046, ~z$w_buff0_used~0=~z$w_buff0_used~0_In162593046, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In162593046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In162593046, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out162593046|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:33:16,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1350565535 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1350565535 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_In-1350565535 ~z$r_buff0_thd4~0_Out-1350565535)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-1350565535) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1350565535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1350565535} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1350565535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1350565535, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-1350565535|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:33:16,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In905463031 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In905463031 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In905463031 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In905463031 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out905463031| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite14_Out905463031| ~z$r_buff1_thd4~0_In905463031) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In905463031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In905463031, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In905463031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In905463031} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In905463031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In905463031, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out905463031|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In905463031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In905463031} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:33:16,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:33:16,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:33:16,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1966729816 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1966729816 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1966729816| 0)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-1966729816| ~z$w_buff0_used~0_In-1966729816) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966729816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1966729816} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1966729816|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1966729816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1966729816} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:33:16,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In392755196 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In392755196 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In392755196 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In392755196 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out392755196| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite6_Out392755196| ~z$w_buff1_used~0_In392755196)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In392755196, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In392755196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In392755196, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In392755196} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out392755196|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In392755196, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In392755196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In392755196, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In392755196} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:33:16,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In996029393 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In996029393 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out996029393| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out996029393| ~z$r_buff0_thd3~0_In996029393) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In996029393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In996029393} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In996029393, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In996029393, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out996029393|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:33:16,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-52580162 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-52580162 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-52580162 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-52580162 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-52580162|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-52580162 |P2Thread1of1ForFork2_#t~ite8_Out-52580162|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-52580162, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-52580162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-52580162, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-52580162} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-52580162, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-52580162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-52580162, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-52580162, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-52580162|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:33:16,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:33:16,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 21:33:16,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1861296082 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1861296082 256) 0))) (or (and (= ~z$w_buff1~0_In-1861296082 |ULTIMATE.start_main_#t~ite19_Out-1861296082|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1861296082 |ULTIMATE.start_main_#t~ite19_Out-1861296082|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1861296082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1861296082, ~z$w_buff1~0=~z$w_buff1~0_In-1861296082, ~z~0=~z~0_In-1861296082} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1861296082|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1861296082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1861296082, ~z$w_buff1~0=~z$w_buff1~0_In-1861296082, ~z~0=~z~0_In-1861296082} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:33:16,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:33:16,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1435416609 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1435416609 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1435416609| ~z$w_buff0_used~0_In-1435416609)) (and (= |ULTIMATE.start_main_#t~ite21_Out-1435416609| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1435416609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435416609} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1435416609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1435416609, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1435416609|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:33:16,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1986018985 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1986018985 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1986018985 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1986018985 256)))) (or (and (= ~z$w_buff1_used~0_In1986018985 |ULTIMATE.start_main_#t~ite22_Out1986018985|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite22_Out1986018985|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1986018985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986018985, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1986018985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986018985} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1986018985, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1986018985, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1986018985, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1986018985, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1986018985|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:33:16,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In460041737 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In460041737 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out460041737| ~z$r_buff0_thd0~0_In460041737)) (and (= |ULTIMATE.start_main_#t~ite23_Out460041737| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In460041737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In460041737} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In460041737, ~z$w_buff0_used~0=~z$w_buff0_used~0_In460041737, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out460041737|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:33:16,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1573413467 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1573413467 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1573413467 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1573413467 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1573413467| ~z$r_buff1_thd0~0_In1573413467) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out1573413467| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1573413467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1573413467, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1573413467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1573413467} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1573413467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1573413467, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1573413467, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1573413467|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1573413467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:33:16,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1383729009 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1383729009 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-1383729009 256) 0)) (= (mod ~z$w_buff0_used~0_In-1383729009 256) 0) (and (= (mod ~z$r_buff1_thd0~0_In-1383729009 256) 0) .cse0))) .cse1 (= ~z$w_buff1_used~0_In-1383729009 |ULTIMATE.start_main_#t~ite39_Out-1383729009|) (= |ULTIMATE.start_main_#t~ite39_Out-1383729009| |ULTIMATE.start_main_#t~ite40_Out-1383729009|)) (and (= ~z$w_buff1_used~0_In-1383729009 |ULTIMATE.start_main_#t~ite40_Out-1383729009|) (= |ULTIMATE.start_main_#t~ite39_In-1383729009| |ULTIMATE.start_main_#t~ite39_Out-1383729009|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1383729009, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1383729009, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1383729009|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1383729009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1383729009, ~weak$$choice2~0=~weak$$choice2~0_In-1383729009} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1383729009, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1383729009|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1383729009|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1383729009, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1383729009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1383729009, ~weak$$choice2~0=~weak$$choice2~0_In-1383729009} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:33:16,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:33:16,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1125696763 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1125696763 256))) (.cse4 (= |ULTIMATE.start_main_#t~ite46_Out-1125696763| |ULTIMATE.start_main_#t~ite45_Out-1125696763|)) (.cse5 (= (mod ~weak$$choice2~0_In-1125696763 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1125696763 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1125696763 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_In-1125696763| |ULTIMATE.start_main_#t~ite44_Out-1125696763|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse1 .cse3)) .cse4 .cse5 (= |ULTIMATE.start_main_#t~ite45_Out-1125696763| ~z$r_buff1_thd0~0_In-1125696763)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1125696763| ~z$r_buff1_thd0~0_In-1125696763) (= |ULTIMATE.start_main_#t~ite45_Out-1125696763| |ULTIMATE.start_main_#t~ite45_In-1125696763|) (not .cse5)))) (let ((.cse6 (not .cse1))) (and (not .cse2) (= |ULTIMATE.start_main_#t~ite44_Out-1125696763| 0) (= |ULTIMATE.start_main_#t~ite45_Out-1125696763| |ULTIMATE.start_main_#t~ite44_Out-1125696763|) (or (not .cse0) .cse6) .cse4 .cse5 (or .cse6 (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1125696763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1125696763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1125696763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1125696763, ~weak$$choice2~0=~weak$$choice2~0_In-1125696763, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1125696763|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1125696763|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1125696763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1125696763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1125696763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1125696763, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1125696763|, ~weak$$choice2~0=~weak$$choice2~0_In-1125696763, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1125696763|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1125696763|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:33:16,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:33:16,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:33:16,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:33:16 BasicIcfg [2019-12-18 21:33:16,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:33:16,669 INFO L168 Benchmark]: Toolchain (without parser) took 26572.51 ms. Allocated memory was 137.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 100.0 MB in the beginning and 1.1 GB in the end (delta: -950.9 MB). Peak memory consumption was 286.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,670 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.16 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 153.3 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.18 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 149.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,675 INFO L168 Benchmark]: Boogie Preprocessor took 40.78 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,676 INFO L168 Benchmark]: RCFGBuilder took 899.33 ms. Allocated memory is still 201.9 MB. Free memory was 147.7 MB in the beginning and 97.7 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,679 INFO L168 Benchmark]: TraceAbstraction took 24767.62 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 97.7 MB in the beginning and 1.1 GB in the end (delta: -953.1 MB). Peak memory consumption was 219.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:33:16,685 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.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.16 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 99.8 MB in the beginning and 153.3 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.18 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 149.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.78 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 899.33 ms. Allocated memory is still 201.9 MB. Free memory was 147.7 MB in the beginning and 97.7 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24767.62 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 97.7 MB in the beginning and 1.1 GB in the end (delta: -953.1 MB). Peak memory consumption was 219.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L835] FCALL, FORK 0 pthread_create(&t1238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L837] FCALL, FORK 0 pthread_create(&t1239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L839] FCALL, FORK 0 pthread_create(&t1240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 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 [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1674 SDtfs, 1685 SDslu, 3608 SDs, 0 SdLazy, 1125 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred 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: 8.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 8699 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 614 ConstructedInterpolants, 0 QuantifiedInterpolants, 152070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...