/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:35:07,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:35:07,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:35:07,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:35:07,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:35:07,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:35:07,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:35:07,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:35:07,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:35:07,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:35:07,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:35:07,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:35:07,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:35:07,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:35:07,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:35:07,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:35:07,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:35:07,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:35:07,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:35:07,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:35:07,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:35:07,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:35:07,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:35:07,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:35:07,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:35:07,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:35:07,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:35:07,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:35:07,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:35:07,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:35:07,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:35:07,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:35:07,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:35:07,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:35:07,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:35:07,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:35:07,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:35:07,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:35:07,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:35:07,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:35:07,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:35:07,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:35:07,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:35:07,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:35:07,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:35:07,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:35:07,977 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:35:07,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:35:07,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:35:07,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:35:07,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:35:07,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:35:07,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:35:07,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:35:07,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:35:07,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:35:07,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:35:07,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:35:07,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:35:07,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:35:07,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:35:07,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:35:07,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:35:07,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:35:07,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:35:07,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:35:07,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:35:07,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:35:07,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:35:07,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:35:07,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:35:07,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:35:08,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:35:08,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:35:08,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:35:08,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:35:08,310 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:35:08,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i [2019-12-18 12:35:08,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a0c7332/d01f6c9245a346b784c71398585d08fc/FLAGfbc0f2b07 [2019-12-18 12:35:08,909 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:35:08,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i [2019-12-18 12:35:08,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a0c7332/d01f6c9245a346b784c71398585d08fc/FLAGfbc0f2b07 [2019-12-18 12:35:09,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5a0c7332/d01f6c9245a346b784c71398585d08fc [2019-12-18 12:35:09,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:35:09,224 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:35:09,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:35:09,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:35:09,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:35:09,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:35:09" (1/1) ... [2019-12-18 12:35:09,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:09, skipping insertion in model container [2019-12-18 12:35:09,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:35:09" (1/1) ... [2019-12-18 12:35:09,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:35:09,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:35:09,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:35:09,847 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:35:09,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:35:10,020 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:35:10,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10 WrapperNode [2019-12-18 12:35:10,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:35:10,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:35:10,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:35:10,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:35:10,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:35:10,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:35:10,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:35:10,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:35:10,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (1/1) ... [2019-12-18 12:35:10,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:35:10,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:35:10,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:35:10,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:35:10,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (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 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:35:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:35:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:35:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:35:10,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:35:10,215 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:35:10,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:35:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:35:10,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:35:10,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:35:10,218 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 12:35:11,054 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:35:11,055 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:35:11,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:35:11 BoogieIcfgContainer [2019-12-18 12:35:11,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:35:11,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:35:11,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:35:11,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:35:11,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:35:09" (1/3) ... [2019-12-18 12:35:11,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aee25f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:35:11, skipping insertion in model container [2019-12-18 12:35:11,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:35:10" (2/3) ... [2019-12-18 12:35:11,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aee25f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:35:11, skipping insertion in model container [2019-12-18 12:35:11,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:35:11" (3/3) ... [2019-12-18 12:35:11,066 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_tso.oepc.i [2019-12-18 12:35:11,075 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:35:11,075 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:35:11,082 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:35:11,083 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:35:11,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,145 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,147 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,157 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,159 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,160 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,162 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,179 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,180 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,193 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,194 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,224 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,225 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:35:11,266 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:35:11,284 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:35:11,284 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:35:11,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:35:11,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:35:11,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:35:11,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:35:11,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:35:11,285 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:35:11,299 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:35:11,301 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:35:11,400 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:35:11,402 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:35:11,426 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:35:11,453 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:35:11,529 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:35:11,529 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:35:11,541 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:35:11,561 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:35:11,562 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:35:16,375 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-18 12:35:16,488 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-12-18 12:35:16,768 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:35:16,923 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:35:16,950 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-18 12:35:16,950 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 12:35:16,954 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-18 12:35:31,718 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-18 12:35:31,720 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-18 12:35:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:35:31,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:31,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:35:31,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-18 12:35:31,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:31,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547344288] [2019-12-18 12:35:31,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:32,006 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 12:35:32,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547344288] [2019-12-18 12:35:32,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:32,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:35:32,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161516844] [2019-12-18 12:35:32,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:35:32,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:32,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:35:32,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:35:32,035 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-18 12:35:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:35,873 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-18 12:35:35,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:35:35,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:35:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:36,662 INFO L225 Difference]: With dead ends: 106034 [2019-12-18 12:35:36,662 INFO L226 Difference]: Without dead ends: 99950 [2019-12-18 12:35:36,664 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 12:35:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-18 12:35:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-18 12:35:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-18 12:35:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-18 12:35:45,571 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-18 12:35:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:35:45,571 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-18 12:35:45,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:35:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-18 12:35:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:35:45,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:35:45,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:35:45,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:35:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:35:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-18 12:35:45,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:35:45,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582653302] [2019-12-18 12:35:45,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:35:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:35:45,691 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 12:35:45,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582653302] [2019-12-18 12:35:45,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:35:45,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:35:45,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536136061] [2019-12-18 12:35:45,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:35:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:35:45,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:35:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:35:45,696 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-18 12:35:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:35:50,722 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-18 12:35:50,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:35:50,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:35:50,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:35:51,387 INFO L225 Difference]: With dead ends: 159384 [2019-12-18 12:35:51,387 INFO L226 Difference]: Without dead ends: 159335 [2019-12-18 12:35:51,388 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 12:35:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-18 12:36:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-18 12:36:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-18 12:36:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-18 12:36:02,084 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-18 12:36:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:02,084 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-18 12:36:02,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:36:02,084 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-18 12:36:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:36:02,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:02,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:02,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-18 12:36:02,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:02,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887201124] [2019-12-18 12:36:02,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:02,182 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 12:36:02,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887201124] [2019-12-18 12:36:02,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:02,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:02,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978126871] [2019-12-18 12:36:02,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:36:02,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:02,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:36:02,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:36:02,184 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-18 12:36:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:02,392 INFO L93 Difference]: Finished difference Result 42595 states and 146341 transitions. [2019-12-18 12:36:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:36:02,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:36:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:02,455 INFO L225 Difference]: With dead ends: 42595 [2019-12-18 12:36:02,455 INFO L226 Difference]: Without dead ends: 32718 [2019-12-18 12:36:02,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32718 states. [2019-12-18 12:36:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32718 to 32622. [2019-12-18 12:36:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-18 12:36:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 106518 transitions. [2019-12-18 12:36:07,605 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 106518 transitions. Word has length 13 [2019-12-18 12:36:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:07,606 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 106518 transitions. [2019-12-18 12:36:07,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:36:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 106518 transitions. [2019-12-18 12:36:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:36:07,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:07,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:07,610 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-18 12:36:07,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:07,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543906340] [2019-12-18 12:36:07,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:07,711 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 12:36:07,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543906340] [2019-12-18 12:36:07,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:07,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:07,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514092423] [2019-12-18 12:36:07,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:36:07,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:36:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:36:07,713 INFO L87 Difference]: Start difference. First operand 32622 states and 106518 transitions. Second operand 4 states. [2019-12-18 12:36:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:08,095 INFO L93 Difference]: Finished difference Result 41342 states and 134101 transitions. [2019-12-18 12:36:08,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:36:08,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:36:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:08,163 INFO L225 Difference]: With dead ends: 41342 [2019-12-18 12:36:08,163 INFO L226 Difference]: Without dead ends: 41342 [2019-12-18 12:36:08,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2019-12-18 12:36:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 37015. [2019-12-18 12:36:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37015 states. [2019-12-18 12:36:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37015 states to 37015 states and 120557 transitions. [2019-12-18 12:36:09,377 INFO L78 Accepts]: Start accepts. Automaton has 37015 states and 120557 transitions. Word has length 16 [2019-12-18 12:36:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:09,377 INFO L462 AbstractCegarLoop]: Abstraction has 37015 states and 120557 transitions. [2019-12-18 12:36:09,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:36:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 37015 states and 120557 transitions. [2019-12-18 12:36:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:36:09,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:09,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:09,380 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-18 12:36:09,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:09,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468518822] [2019-12-18 12:36:09,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:09,472 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 12:36:09,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468518822] [2019-12-18 12:36:09,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:09,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:09,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486652298] [2019-12-18 12:36:09,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:36:09,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:09,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:36:09,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:36:09,474 INFO L87 Difference]: Start difference. First operand 37015 states and 120557 transitions. Second operand 4 states. [2019-12-18 12:36:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:09,883 INFO L93 Difference]: Finished difference Result 44892 states and 145334 transitions. [2019-12-18 12:36:09,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:36:09,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:36:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:09,957 INFO L225 Difference]: With dead ends: 44892 [2019-12-18 12:36:09,958 INFO L226 Difference]: Without dead ends: 44892 [2019-12-18 12:36:09,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44892 states. [2019-12-18 12:36:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44892 to 36810. [2019-12-18 12:36:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36810 states. [2019-12-18 12:36:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36810 states to 36810 states and 119696 transitions. [2019-12-18 12:36:10,670 INFO L78 Accepts]: Start accepts. Automaton has 36810 states and 119696 transitions. Word has length 16 [2019-12-18 12:36:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:10,671 INFO L462 AbstractCegarLoop]: Abstraction has 36810 states and 119696 transitions. [2019-12-18 12:36:10,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:36:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36810 states and 119696 transitions. [2019-12-18 12:36:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:36:10,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:10,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:10,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:10,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:10,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-18 12:36:10,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:10,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077142861] [2019-12-18 12:36:10,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:10,803 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 12:36:10,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077142861] [2019-12-18 12:36:10,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:10,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:10,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494054027] [2019-12-18 12:36:10,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:10,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:10,806 INFO L87 Difference]: Start difference. First operand 36810 states and 119696 transitions. Second operand 5 states. [2019-12-18 12:36:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:11,742 INFO L93 Difference]: Finished difference Result 55448 states and 177239 transitions. [2019-12-18 12:36:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:36:11,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:36:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:11,836 INFO L225 Difference]: With dead ends: 55448 [2019-12-18 12:36:11,837 INFO L226 Difference]: Without dead ends: 55392 [2019-12-18 12:36:11,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:36:12,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55392 states. [2019-12-18 12:36:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55392 to 38696. [2019-12-18 12:36:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38696 states. [2019-12-18 12:36:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38696 states to 38696 states and 125822 transitions. [2019-12-18 12:36:12,580 INFO L78 Accepts]: Start accepts. Automaton has 38696 states and 125822 transitions. Word has length 22 [2019-12-18 12:36:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:12,581 INFO L462 AbstractCegarLoop]: Abstraction has 38696 states and 125822 transitions. [2019-12-18 12:36:12,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 38696 states and 125822 transitions. [2019-12-18 12:36:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:36:12,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:12,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:12,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:12,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-18 12:36:12,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:12,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748241232] [2019-12-18 12:36:12,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:12,686 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 12:36:12,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748241232] [2019-12-18 12:36:12,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:12,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:12,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065637392] [2019-12-18 12:36:12,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:12,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:12,689 INFO L87 Difference]: Start difference. First operand 38696 states and 125822 transitions. Second operand 5 states. [2019-12-18 12:36:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:13,373 INFO L93 Difference]: Finished difference Result 57418 states and 182937 transitions. [2019-12-18 12:36:13,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:36:13,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:36:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:13,471 INFO L225 Difference]: With dead ends: 57418 [2019-12-18 12:36:13,471 INFO L226 Difference]: Without dead ends: 57362 [2019-12-18 12:36:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:36:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57362 states. [2019-12-18 12:36:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57362 to 36190. [2019-12-18 12:36:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36190 states. [2019-12-18 12:36:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36190 states to 36190 states and 117443 transitions. [2019-12-18 12:36:14,553 INFO L78 Accepts]: Start accepts. Automaton has 36190 states and 117443 transitions. Word has length 22 [2019-12-18 12:36:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:14,554 INFO L462 AbstractCegarLoop]: Abstraction has 36190 states and 117443 transitions. [2019-12-18 12:36:14,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 36190 states and 117443 transitions. [2019-12-18 12:36:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:36:14,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:14,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:14,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-18 12:36:14,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:14,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126813157] [2019-12-18 12:36:14,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:14,664 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 12:36:14,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126813157] [2019-12-18 12:36:14,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:14,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:14,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364480365] [2019-12-18 12:36:14,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:14,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:14,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:14,667 INFO L87 Difference]: Start difference. First operand 36190 states and 117443 transitions. Second operand 5 states. [2019-12-18 12:36:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:15,363 INFO L93 Difference]: Finished difference Result 50960 states and 161781 transitions. [2019-12-18 12:36:15,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:36:15,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 12:36:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:15,449 INFO L225 Difference]: With dead ends: 50960 [2019-12-18 12:36:15,449 INFO L226 Difference]: Without dead ends: 50947 [2019-12-18 12:36:15,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50947 states. [2019-12-18 12:36:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50947 to 41982. [2019-12-18 12:36:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41982 states. [2019-12-18 12:36:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41982 states to 41982 states and 135844 transitions. [2019-12-18 12:36:16,552 INFO L78 Accepts]: Start accepts. Automaton has 41982 states and 135844 transitions. Word has length 25 [2019-12-18 12:36:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:16,553 INFO L462 AbstractCegarLoop]: Abstraction has 41982 states and 135844 transitions. [2019-12-18 12:36:16,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 41982 states and 135844 transitions. [2019-12-18 12:36:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:36:16,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:16,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:16,565 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:16,566 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-18 12:36:16,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:16,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737046581] [2019-12-18 12:36:16,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:16,599 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 12:36:16,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737046581] [2019-12-18 12:36:16,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:16,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:16,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834640472] [2019-12-18 12:36:16,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:16,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:16,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:16,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:16,601 INFO L87 Difference]: Start difference. First operand 41982 states and 135844 transitions. Second operand 3 states. [2019-12-18 12:36:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:16,829 INFO L93 Difference]: Finished difference Result 64909 states and 208822 transitions. [2019-12-18 12:36:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:16,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:36:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:16,944 INFO L225 Difference]: With dead ends: 64909 [2019-12-18 12:36:16,944 INFO L226 Difference]: Without dead ends: 64909 [2019-12-18 12:36:16,944 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 12:36:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-18 12:36:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 49315. [2019-12-18 12:36:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49315 states. [2019-12-18 12:36:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49315 states to 49315 states and 159887 transitions. [2019-12-18 12:36:18,380 INFO L78 Accepts]: Start accepts. Automaton has 49315 states and 159887 transitions. Word has length 27 [2019-12-18 12:36:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:18,381 INFO L462 AbstractCegarLoop]: Abstraction has 49315 states and 159887 transitions. [2019-12-18 12:36:18,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 49315 states and 159887 transitions. [2019-12-18 12:36:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:36:18,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:18,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:18,396 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-18 12:36:18,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:18,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420378772] [2019-12-18 12:36:18,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:36:18,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420378772] [2019-12-18 12:36:18,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:18,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:18,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849713963] [2019-12-18 12:36:18,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:18,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:18,436 INFO L87 Difference]: Start difference. First operand 49315 states and 159887 transitions. Second operand 3 states. [2019-12-18 12:36:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:18,785 INFO L93 Difference]: Finished difference Result 64909 states and 203873 transitions. [2019-12-18 12:36:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:18,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:36:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:18,942 INFO L225 Difference]: With dead ends: 64909 [2019-12-18 12:36:18,942 INFO L226 Difference]: Without dead ends: 64909 [2019-12-18 12:36:18,943 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 12:36:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-18 12:36:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 49315. [2019-12-18 12:36:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49315 states. [2019-12-18 12:36:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49315 states to 49315 states and 154938 transitions. [2019-12-18 12:36:20,657 INFO L78 Accepts]: Start accepts. Automaton has 49315 states and 154938 transitions. Word has length 27 [2019-12-18 12:36:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:20,657 INFO L462 AbstractCegarLoop]: Abstraction has 49315 states and 154938 transitions. [2019-12-18 12:36:20,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 49315 states and 154938 transitions. [2019-12-18 12:36:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:36:20,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:20,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:20,672 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:20,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-18 12:36:20,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:20,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146363240] [2019-12-18 12:36:20,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:20,767 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 12:36:20,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146363240] [2019-12-18 12:36:20,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:20,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:20,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446466477] [2019-12-18 12:36:20,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:20,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:20,769 INFO L87 Difference]: Start difference. First operand 49315 states and 154938 transitions. Second operand 5 states. [2019-12-18 12:36:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:21,261 INFO L93 Difference]: Finished difference Result 60684 states and 188418 transitions. [2019-12-18 12:36:21,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:36:21,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:36:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:21,363 INFO L225 Difference]: With dead ends: 60684 [2019-12-18 12:36:21,364 INFO L226 Difference]: Without dead ends: 60508 [2019-12-18 12:36:21,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60508 states. [2019-12-18 12:36:22,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60508 to 53763. [2019-12-18 12:36:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53763 states. [2019-12-18 12:36:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53763 states to 53763 states and 168544 transitions. [2019-12-18 12:36:22,262 INFO L78 Accepts]: Start accepts. Automaton has 53763 states and 168544 transitions. Word has length 27 [2019-12-18 12:36:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:22,262 INFO L462 AbstractCegarLoop]: Abstraction has 53763 states and 168544 transitions. [2019-12-18 12:36:22,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 53763 states and 168544 transitions. [2019-12-18 12:36:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:36:22,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:22,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] [2019-12-18 12:36:22,278 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash -782285250, now seen corresponding path program 1 times [2019-12-18 12:36:22,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:22,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177955833] [2019-12-18 12:36:22,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:22,339 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 12:36:22,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177955833] [2019-12-18 12:36:22,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:22,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:36:22,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64954621] [2019-12-18 12:36:22,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:22,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:22,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:22,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:22,341 INFO L87 Difference]: Start difference. First operand 53763 states and 168544 transitions. Second operand 3 states. [2019-12-18 12:36:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:22,518 INFO L93 Difference]: Finished difference Result 53712 states and 168392 transitions. [2019-12-18 12:36:22,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:22,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-18 12:36:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:22,605 INFO L225 Difference]: With dead ends: 53712 [2019-12-18 12:36:22,605 INFO L226 Difference]: Without dead ends: 53712 [2019-12-18 12:36:22,606 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 12:36:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53712 states. [2019-12-18 12:36:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53712 to 53712. [2019-12-18 12:36:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53712 states. [2019-12-18 12:36:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53712 states to 53712 states and 168392 transitions. [2019-12-18 12:36:23,835 INFO L78 Accepts]: Start accepts. Automaton has 53712 states and 168392 transitions. Word has length 28 [2019-12-18 12:36:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:23,835 INFO L462 AbstractCegarLoop]: Abstraction has 53712 states and 168392 transitions. [2019-12-18 12:36:23,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 53712 states and 168392 transitions. [2019-12-18 12:36:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:36:23,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:23,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:23,853 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-18 12:36:23,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:23,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204922258] [2019-12-18 12:36:23,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:23,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 12:36:23,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204922258] [2019-12-18 12:36:23,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:23,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:36:23,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572888052] [2019-12-18 12:36:23,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:36:23,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:23,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:36:23,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:36:23,964 INFO L87 Difference]: Start difference. First operand 53712 states and 168392 transitions. Second operand 6 states. [2019-12-18 12:36:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:24,235 INFO L93 Difference]: Finished difference Result 69752 states and 217160 transitions. [2019-12-18 12:36:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:36:24,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:36:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:24,349 INFO L225 Difference]: With dead ends: 69752 [2019-12-18 12:36:24,350 INFO L226 Difference]: Without dead ends: 69752 [2019-12-18 12:36:24,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69752 states. [2019-12-18 12:36:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69752 to 54858. [2019-12-18 12:36:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54858 states. [2019-12-18 12:36:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54858 states to 54858 states and 171684 transitions. [2019-12-18 12:36:25,812 INFO L78 Accepts]: Start accepts. Automaton has 54858 states and 171684 transitions. Word has length 28 [2019-12-18 12:36:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:25,812 INFO L462 AbstractCegarLoop]: Abstraction has 54858 states and 171684 transitions. [2019-12-18 12:36:25,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:36:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 54858 states and 171684 transitions. [2019-12-18 12:36:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:36:25,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:25,832 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 12:36:25,832 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:25,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash -340313241, now seen corresponding path program 1 times [2019-12-18 12:36:25,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:25,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963954301] [2019-12-18 12:36:25,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:25,911 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 12:36:25,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963954301] [2019-12-18 12:36:25,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:25,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:36:25,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774978136] [2019-12-18 12:36:25,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:25,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:25,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:25,913 INFO L87 Difference]: Start difference. First operand 54858 states and 171684 transitions. Second operand 5 states. [2019-12-18 12:36:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:26,671 INFO L93 Difference]: Finished difference Result 75035 states and 232688 transitions. [2019-12-18 12:36:26,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:36:26,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:36:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:26,795 INFO L225 Difference]: With dead ends: 75035 [2019-12-18 12:36:26,795 INFO L226 Difference]: Without dead ends: 75035 [2019-12-18 12:36:26,796 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 12:36:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75035 states. [2019-12-18 12:36:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75035 to 65273. [2019-12-18 12:36:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65273 states. [2019-12-18 12:36:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65273 states to 65273 states and 204219 transitions. [2019-12-18 12:36:28,383 INFO L78 Accepts]: Start accepts. Automaton has 65273 states and 204219 transitions. Word has length 29 [2019-12-18 12:36:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:28,384 INFO L462 AbstractCegarLoop]: Abstraction has 65273 states and 204219 transitions. [2019-12-18 12:36:28,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 65273 states and 204219 transitions. [2019-12-18 12:36:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:36:28,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:28,405 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 12:36:28,405 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1192824778, now seen corresponding path program 1 times [2019-12-18 12:36:28,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:28,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615579655] [2019-12-18 12:36:28,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:28,488 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 12:36:28,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615579655] [2019-12-18 12:36:28,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:28,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:36:28,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977062918] [2019-12-18 12:36:28,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:28,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:28,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:28,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:28,491 INFO L87 Difference]: Start difference. First operand 65273 states and 204219 transitions. Second operand 5 states. [2019-12-18 12:36:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:29,061 INFO L93 Difference]: Finished difference Result 76622 states and 236968 transitions. [2019-12-18 12:36:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:36:29,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 12:36:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:29,207 INFO L225 Difference]: With dead ends: 76622 [2019-12-18 12:36:29,207 INFO L226 Difference]: Without dead ends: 76438 [2019-12-18 12:36:29,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76438 states. [2019-12-18 12:36:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76438 to 65837. [2019-12-18 12:36:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65837 states. [2019-12-18 12:36:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65837 states to 65837 states and 205842 transitions. [2019-12-18 12:36:31,056 INFO L78 Accepts]: Start accepts. Automaton has 65837 states and 205842 transitions. Word has length 29 [2019-12-18 12:36:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:31,056 INFO L462 AbstractCegarLoop]: Abstraction has 65837 states and 205842 transitions. [2019-12-18 12:36:31,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65837 states and 205842 transitions. [2019-12-18 12:36:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 12:36:31,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:31,082 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] [2019-12-18 12:36:31,082 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:31,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-18 12:36:31,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:31,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415486667] [2019-12-18 12:36:31,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:31,149 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 12:36:31,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415486667] [2019-12-18 12:36:31,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:31,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:36:31,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035145384] [2019-12-18 12:36:31,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:31,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:31,152 INFO L87 Difference]: Start difference. First operand 65837 states and 205842 transitions. Second operand 5 states. [2019-12-18 12:36:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:31,296 INFO L93 Difference]: Finished difference Result 32869 states and 97248 transitions. [2019-12-18 12:36:31,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:36:31,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 12:36:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:31,346 INFO L225 Difference]: With dead ends: 32869 [2019-12-18 12:36:31,346 INFO L226 Difference]: Without dead ends: 28550 [2019-12-18 12:36:31,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28550 states. [2019-12-18 12:36:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28550 to 26488. [2019-12-18 12:36:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26488 states. [2019-12-18 12:36:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26488 states to 26488 states and 78168 transitions. [2019-12-18 12:36:31,726 INFO L78 Accepts]: Start accepts. Automaton has 26488 states and 78168 transitions. Word has length 30 [2019-12-18 12:36:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:31,727 INFO L462 AbstractCegarLoop]: Abstraction has 26488 states and 78168 transitions. [2019-12-18 12:36:31,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26488 states and 78168 transitions. [2019-12-18 12:36:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:36:31,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:31,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:31,752 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-18 12:36:31,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:31,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63808697] [2019-12-18 12:36:31,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:31,848 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 12:36:31,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63808697] [2019-12-18 12:36:31,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:31,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:36:31,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588366353] [2019-12-18 12:36:31,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:36:31,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:36:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:36:31,850 INFO L87 Difference]: Start difference. First operand 26488 states and 78168 transitions. Second operand 6 states. [2019-12-18 12:36:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:32,598 INFO L93 Difference]: Finished difference Result 33299 states and 96867 transitions. [2019-12-18 12:36:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:36:32,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:36:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:32,651 INFO L225 Difference]: With dead ends: 33299 [2019-12-18 12:36:32,651 INFO L226 Difference]: Without dead ends: 32978 [2019-12-18 12:36:32,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:36:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32978 states. [2019-12-18 12:36:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32978 to 27211. [2019-12-18 12:36:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27211 states. [2019-12-18 12:36:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27211 states to 27211 states and 80187 transitions. [2019-12-18 12:36:33,079 INFO L78 Accepts]: Start accepts. Automaton has 27211 states and 80187 transitions. Word has length 33 [2019-12-18 12:36:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:33,079 INFO L462 AbstractCegarLoop]: Abstraction has 27211 states and 80187 transitions. [2019-12-18 12:36:33,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:36:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27211 states and 80187 transitions. [2019-12-18 12:36:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:36:33,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:33,101 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] [2019-12-18 12:36:33,101 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1243510664, now seen corresponding path program 1 times [2019-12-18 12:36:33,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:33,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207224421] [2019-12-18 12:36:33,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:33,198 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 12:36:33,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207224421] [2019-12-18 12:36:33,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:33,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:36:33,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238729810] [2019-12-18 12:36:33,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:36:33,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:33,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:36:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:36:33,201 INFO L87 Difference]: Start difference. First operand 27211 states and 80187 transitions. Second operand 6 states. [2019-12-18 12:36:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:34,463 INFO L93 Difference]: Finished difference Result 32712 states and 95010 transitions. [2019-12-18 12:36:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:36:34,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-18 12:36:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:34,521 INFO L225 Difference]: With dead ends: 32712 [2019-12-18 12:36:34,521 INFO L226 Difference]: Without dead ends: 32337 [2019-12-18 12:36:34,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:36:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32337 states. [2019-12-18 12:36:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32337 to 25003. [2019-12-18 12:36:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25003 states. [2019-12-18 12:36:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25003 states to 25003 states and 73762 transitions. [2019-12-18 12:36:34,961 INFO L78 Accepts]: Start accepts. Automaton has 25003 states and 73762 transitions. Word has length 35 [2019-12-18 12:36:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:34,962 INFO L462 AbstractCegarLoop]: Abstraction has 25003 states and 73762 transitions. [2019-12-18 12:36:34,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:36:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 25003 states and 73762 transitions. [2019-12-18 12:36:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:36:34,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:34,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:34,990 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash 202654059, now seen corresponding path program 1 times [2019-12-18 12:36:34,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:34,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554197168] [2019-12-18 12:36:34,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:35,063 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 12:36:35,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554197168] [2019-12-18 12:36:35,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:35,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:36:35,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495760498] [2019-12-18 12:36:35,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:36:35,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:36:35,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:36:35,065 INFO L87 Difference]: Start difference. First operand 25003 states and 73762 transitions. Second operand 5 states. [2019-12-18 12:36:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:35,716 INFO L93 Difference]: Finished difference Result 35861 states and 105030 transitions. [2019-12-18 12:36:35,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:36:35,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:36:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:35,765 INFO L225 Difference]: With dead ends: 35861 [2019-12-18 12:36:35,765 INFO L226 Difference]: Without dead ends: 35861 [2019-12-18 12:36:35,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35861 states. [2019-12-18 12:36:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35861 to 29292. [2019-12-18 12:36:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29292 states. [2019-12-18 12:36:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29292 states to 29292 states and 86931 transitions. [2019-12-18 12:36:36,234 INFO L78 Accepts]: Start accepts. Automaton has 29292 states and 86931 transitions. Word has length 40 [2019-12-18 12:36:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:36,235 INFO L462 AbstractCegarLoop]: Abstraction has 29292 states and 86931 transitions. [2019-12-18 12:36:36,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:36:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 29292 states and 86931 transitions. [2019-12-18 12:36:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:36:36,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:36,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:36,261 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1689924949, now seen corresponding path program 2 times [2019-12-18 12:36:36,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:36,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029770750] [2019-12-18 12:36:36,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:36,348 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 12:36:36,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029770750] [2019-12-18 12:36:36,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:36,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:36,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445036192] [2019-12-18 12:36:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:36,351 INFO L87 Difference]: Start difference. First operand 29292 states and 86931 transitions. Second operand 3 states. [2019-12-18 12:36:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:36,462 INFO L93 Difference]: Finished difference Result 29205 states and 86665 transitions. [2019-12-18 12:36:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:36,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:36:36,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:36,501 INFO L225 Difference]: With dead ends: 29205 [2019-12-18 12:36:36,501 INFO L226 Difference]: Without dead ends: 29205 [2019-12-18 12:36:36,502 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 12:36:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29205 states. [2019-12-18 12:36:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29205 to 23983. [2019-12-18 12:36:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23983 states. [2019-12-18 12:36:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23983 states to 23983 states and 71984 transitions. [2019-12-18 12:36:36,883 INFO L78 Accepts]: Start accepts. Automaton has 23983 states and 71984 transitions. Word has length 40 [2019-12-18 12:36:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:36,883 INFO L462 AbstractCegarLoop]: Abstraction has 23983 states and 71984 transitions. [2019-12-18 12:36:36,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 23983 states and 71984 transitions. [2019-12-18 12:36:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 12:36:36,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:36,908 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] [2019-12-18 12:36:36,909 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1472692188, now seen corresponding path program 1 times [2019-12-18 12:36:36,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:36,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129762018] [2019-12-18 12:36:36,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:37,320 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 12:36:37,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129762018] [2019-12-18 12:36:37,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:37,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:36:37,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870049070] [2019-12-18 12:36:37,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:36:37,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:37,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:36:37,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:36:37,322 INFO L87 Difference]: Start difference. First operand 23983 states and 71984 transitions. Second operand 6 states. [2019-12-18 12:36:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:37,452 INFO L93 Difference]: Finished difference Result 22617 states and 69033 transitions. [2019-12-18 12:36:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:36:37,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 12:36:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:37,483 INFO L225 Difference]: With dead ends: 22617 [2019-12-18 12:36:37,483 INFO L226 Difference]: Without dead ends: 22468 [2019-12-18 12:36:37,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:36:37,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22468 states. [2019-12-18 12:36:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22468 to 20851. [2019-12-18 12:36:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20851 states. [2019-12-18 12:36:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20851 states to 20851 states and 64081 transitions. [2019-12-18 12:36:37,793 INFO L78 Accepts]: Start accepts. Automaton has 20851 states and 64081 transitions. Word has length 41 [2019-12-18 12:36:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:37,793 INFO L462 AbstractCegarLoop]: Abstraction has 20851 states and 64081 transitions. [2019-12-18 12:36:37,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:36:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 20851 states and 64081 transitions. [2019-12-18 12:36:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:36:37,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:37,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:37,816 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1424537019, now seen corresponding path program 1 times [2019-12-18 12:36:37,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:37,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836392526] [2019-12-18 12:36:37,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:37,894 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 12:36:37,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836392526] [2019-12-18 12:36:37,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:37,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:36:37,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072472957] [2019-12-18 12:36:37,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:36:37,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:36:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:37,896 INFO L87 Difference]: Start difference. First operand 20851 states and 64081 transitions. Second operand 7 states. [2019-12-18 12:36:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:38,377 INFO L93 Difference]: Finished difference Result 58761 states and 178850 transitions. [2019-12-18 12:36:38,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:36:38,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:36:38,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:38,439 INFO L225 Difference]: With dead ends: 58761 [2019-12-18 12:36:38,439 INFO L226 Difference]: Without dead ends: 43614 [2019-12-18 12:36:38,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:36:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43614 states. [2019-12-18 12:36:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43614 to 24645. [2019-12-18 12:36:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24645 states. [2019-12-18 12:36:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24645 states to 24645 states and 75170 transitions. [2019-12-18 12:36:38,954 INFO L78 Accepts]: Start accepts. Automaton has 24645 states and 75170 transitions. Word has length 65 [2019-12-18 12:36:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:38,955 INFO L462 AbstractCegarLoop]: Abstraction has 24645 states and 75170 transitions. [2019-12-18 12:36:38,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:36:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 24645 states and 75170 transitions. [2019-12-18 12:36:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:36:38,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:38,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:38,980 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 872536213, now seen corresponding path program 2 times [2019-12-18 12:36:38,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:38,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406776566] [2019-12-18 12:36:38,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:39,082 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 12:36:39,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406776566] [2019-12-18 12:36:39,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:39,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:36:39,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091093588] [2019-12-18 12:36:39,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:36:39,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:39,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:36:39,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:36:39,084 INFO L87 Difference]: Start difference. First operand 24645 states and 75170 transitions. Second operand 8 states. [2019-12-18 12:36:40,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:40,312 INFO L93 Difference]: Finished difference Result 85886 states and 258153 transitions. [2019-12-18 12:36:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:36:40,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:36:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:40,403 INFO L225 Difference]: With dead ends: 85886 [2019-12-18 12:36:40,403 INFO L226 Difference]: Without dead ends: 62131 [2019-12-18 12:36:40,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:36:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62131 states. [2019-12-18 12:36:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62131 to 28948. [2019-12-18 12:36:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28948 states. [2019-12-18 12:36:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28948 states to 28948 states and 87618 transitions. [2019-12-18 12:36:41,437 INFO L78 Accepts]: Start accepts. Automaton has 28948 states and 87618 transitions. Word has length 65 [2019-12-18 12:36:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:41,437 INFO L462 AbstractCegarLoop]: Abstraction has 28948 states and 87618 transitions. [2019-12-18 12:36:41,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:36:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 28948 states and 87618 transitions. [2019-12-18 12:36:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:36:41,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:41,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, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:41,466 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:41,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:41,466 INFO L82 PathProgramCache]: Analyzing trace with hash 45765331, now seen corresponding path program 3 times [2019-12-18 12:36:41,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:41,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630341928] [2019-12-18 12:36:41,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:41,605 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 12:36:41,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630341928] [2019-12-18 12:36:41,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:41,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:36:41,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755165075] [2019-12-18 12:36:41,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:36:41,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:36:41,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:36:41,609 INFO L87 Difference]: Start difference. First operand 28948 states and 87618 transitions. Second operand 9 states. [2019-12-18 12:36:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:42,962 INFO L93 Difference]: Finished difference Result 104220 states and 310078 transitions. [2019-12-18 12:36:42,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:36:42,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:36:42,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:43,115 INFO L225 Difference]: With dead ends: 104220 [2019-12-18 12:36:43,116 INFO L226 Difference]: Without dead ends: 99809 [2019-12-18 12:36:43,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:36:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99809 states. [2019-12-18 12:36:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99809 to 29391. [2019-12-18 12:36:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29391 states. [2019-12-18 12:36:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29391 states to 29391 states and 88899 transitions. [2019-12-18 12:36:44,087 INFO L78 Accepts]: Start accepts. Automaton has 29391 states and 88899 transitions. Word has length 65 [2019-12-18 12:36:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:44,088 INFO L462 AbstractCegarLoop]: Abstraction has 29391 states and 88899 transitions. [2019-12-18 12:36:44,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:36:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29391 states and 88899 transitions. [2019-12-18 12:36:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:36:44,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:44,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, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:44,467 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1660891443, now seen corresponding path program 4 times [2019-12-18 12:36:44,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:44,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61578121] [2019-12-18 12:36:44,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:44,573 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 12:36:44,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61578121] [2019-12-18 12:36:44,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:44,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:36:44,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306961986] [2019-12-18 12:36:44,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:36:44,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:44,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:36:44,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:36:44,575 INFO L87 Difference]: Start difference. First operand 29391 states and 88899 transitions. Second operand 9 states. [2019-12-18 12:36:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:45,916 INFO L93 Difference]: Finished difference Result 80796 states and 241185 transitions. [2019-12-18 12:36:45,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:36:45,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:36:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:46,029 INFO L225 Difference]: With dead ends: 80796 [2019-12-18 12:36:46,029 INFO L226 Difference]: Without dead ends: 78469 [2019-12-18 12:36:46,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:36:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78469 states. [2019-12-18 12:36:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78469 to 29167. [2019-12-18 12:36:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29167 states. [2019-12-18 12:36:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29167 states to 29167 states and 88403 transitions. [2019-12-18 12:36:46,869 INFO L78 Accepts]: Start accepts. Automaton has 29167 states and 88403 transitions. Word has length 65 [2019-12-18 12:36:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:46,869 INFO L462 AbstractCegarLoop]: Abstraction has 29167 states and 88403 transitions. [2019-12-18 12:36:46,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:36:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29167 states and 88403 transitions. [2019-12-18 12:36:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:36:46,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:46,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:46,903 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:46,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash 937822065, now seen corresponding path program 5 times [2019-12-18 12:36:46,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:46,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693660978] [2019-12-18 12:36:46,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:46,983 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 12:36:46,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693660978] [2019-12-18 12:36:46,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:46,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:36:46,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799241181] [2019-12-18 12:36:46,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:36:46,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:36:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:36:46,985 INFO L87 Difference]: Start difference. First operand 29167 states and 88403 transitions. Second operand 7 states. [2019-12-18 12:36:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:47,535 INFO L93 Difference]: Finished difference Result 58137 states and 173502 transitions. [2019-12-18 12:36:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:36:47,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:36:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:47,632 INFO L225 Difference]: With dead ends: 58137 [2019-12-18 12:36:47,633 INFO L226 Difference]: Without dead ends: 48826 [2019-12-18 12:36:47,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:36:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48826 states. [2019-12-18 12:36:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48826 to 29179. [2019-12-18 12:36:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29179 states. [2019-12-18 12:36:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29179 states to 29179 states and 88374 transitions. [2019-12-18 12:36:48,739 INFO L78 Accepts]: Start accepts. Automaton has 29179 states and 88374 transitions. Word has length 65 [2019-12-18 12:36:48,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:48,740 INFO L462 AbstractCegarLoop]: Abstraction has 29179 states and 88374 transitions. [2019-12-18 12:36:48,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:36:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 29179 states and 88374 transitions. [2019-12-18 12:36:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:36:48,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:48,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:48,771 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:48,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1903736173, now seen corresponding path program 6 times [2019-12-18 12:36:48,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:48,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229638605] [2019-12-18 12:36:48,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:48,824 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 12:36:48,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229638605] [2019-12-18 12:36:48,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:48,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:48,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002561661] [2019-12-18 12:36:48,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:48,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:48,826 INFO L87 Difference]: Start difference. First operand 29179 states and 88374 transitions. Second operand 3 states. [2019-12-18 12:36:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:49,032 INFO L93 Difference]: Finished difference Result 32141 states and 97214 transitions. [2019-12-18 12:36:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:49,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:36:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:49,101 INFO L225 Difference]: With dead ends: 32141 [2019-12-18 12:36:49,102 INFO L226 Difference]: Without dead ends: 32141 [2019-12-18 12:36:49,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32141 states. [2019-12-18 12:36:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32141 to 26925. [2019-12-18 12:36:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26925 states. [2019-12-18 12:36:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26925 states to 26925 states and 82185 transitions. [2019-12-18 12:36:49,769 INFO L78 Accepts]: Start accepts. Automaton has 26925 states and 82185 transitions. Word has length 65 [2019-12-18 12:36:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:49,769 INFO L462 AbstractCegarLoop]: Abstraction has 26925 states and 82185 transitions. [2019-12-18 12:36:49,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26925 states and 82185 transitions. [2019-12-18 12:36:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:36:49,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:49,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:49,797 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash -243481851, now seen corresponding path program 1 times [2019-12-18 12:36:49,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:49,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122949944] [2019-12-18 12:36:49,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:49,868 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 12:36:49,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122949944] [2019-12-18 12:36:49,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:49,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:36:49,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436200852] [2019-12-18 12:36:49,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:36:49,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:49,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:36:49,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:36:49,870 INFO L87 Difference]: Start difference. First operand 26925 states and 82185 transitions. Second operand 6 states. [2019-12-18 12:36:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:50,696 INFO L93 Difference]: Finished difference Result 34530 states and 103452 transitions. [2019-12-18 12:36:50,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:36:50,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 12:36:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:50,744 INFO L225 Difference]: With dead ends: 34530 [2019-12-18 12:36:50,744 INFO L226 Difference]: Without dead ends: 34530 [2019-12-18 12:36:50,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:36:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34530 states. [2019-12-18 12:36:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34530 to 26841. [2019-12-18 12:36:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26841 states. [2019-12-18 12:36:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26841 states to 26841 states and 81917 transitions. [2019-12-18 12:36:51,201 INFO L78 Accepts]: Start accepts. Automaton has 26841 states and 81917 transitions. Word has length 66 [2019-12-18 12:36:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:51,202 INFO L462 AbstractCegarLoop]: Abstraction has 26841 states and 81917 transitions. [2019-12-18 12:36:51,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:36:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 26841 states and 81917 transitions. [2019-12-18 12:36:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:36:51,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:51,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:36:51,229 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:51,229 INFO L82 PathProgramCache]: Analyzing trace with hash -44744943, now seen corresponding path program 2 times [2019-12-18 12:36:51,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:51,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037303805] [2019-12-18 12:36:51,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:51,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 12:36:51,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037303805] [2019-12-18 12:36:51,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:51,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:36:51,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591337519] [2019-12-18 12:36:51,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:36:51,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:36:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:36:51,384 INFO L87 Difference]: Start difference. First operand 26841 states and 81917 transitions. Second operand 8 states. [2019-12-18 12:36:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:52,776 INFO L93 Difference]: Finished difference Result 35066 states and 105373 transitions. [2019-12-18 12:36:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:36:52,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:36:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:52,823 INFO L225 Difference]: With dead ends: 35066 [2019-12-18 12:36:52,824 INFO L226 Difference]: Without dead ends: 35066 [2019-12-18 12:36:52,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:36:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35066 states. [2019-12-18 12:36:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35066 to 26989. [2019-12-18 12:36:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26989 states. [2019-12-18 12:36:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 82366 transitions. [2019-12-18 12:36:53,578 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 82366 transitions. Word has length 66 [2019-12-18 12:36:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:53,578 INFO L462 AbstractCegarLoop]: Abstraction has 26989 states and 82366 transitions. [2019-12-18 12:36:53,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:36:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 82366 transitions. [2019-12-18 12:36:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:36:53,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:53,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:53,609 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:53,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:53,609 INFO L82 PathProgramCache]: Analyzing trace with hash 158833765, now seen corresponding path program 3 times [2019-12-18 12:36:53,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:53,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385684927] [2019-12-18 12:36:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:53,769 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 12:36:53,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385684927] [2019-12-18 12:36:53,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:53,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:36:53,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846341439] [2019-12-18 12:36:53,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:36:53,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:36:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:36:53,771 INFO L87 Difference]: Start difference. First operand 26989 states and 82366 transitions. Second operand 9 states. [2019-12-18 12:36:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:55,151 INFO L93 Difference]: Finished difference Result 36682 states and 109686 transitions. [2019-12-18 12:36:55,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:36:55,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:36:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:55,202 INFO L225 Difference]: With dead ends: 36682 [2019-12-18 12:36:55,202 INFO L226 Difference]: Without dead ends: 36682 [2019-12-18 12:36:55,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:36:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36682 states. [2019-12-18 12:36:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36682 to 26715. [2019-12-18 12:36:55,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26715 states. [2019-12-18 12:36:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26715 states to 26715 states and 81544 transitions. [2019-12-18 12:36:55,669 INFO L78 Accepts]: Start accepts. Automaton has 26715 states and 81544 transitions. Word has length 66 [2019-12-18 12:36:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:55,669 INFO L462 AbstractCegarLoop]: Abstraction has 26715 states and 81544 transitions. [2019-12-18 12:36:55,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:36:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 26715 states and 81544 transitions. [2019-12-18 12:36:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:36:55,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:55,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:55,697 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1480053167, now seen corresponding path program 4 times [2019-12-18 12:36:55,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:55,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979922151] [2019-12-18 12:36:55,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:36:55,753 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 12:36:55,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979922151] [2019-12-18 12:36:55,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:36:55,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:36:55,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825464027] [2019-12-18 12:36:55,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:36:55,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:36:55,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:36:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:36:55,755 INFO L87 Difference]: Start difference. First operand 26715 states and 81544 transitions. Second operand 3 states. [2019-12-18 12:36:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:36:55,842 INFO L93 Difference]: Finished difference Result 21147 states and 63753 transitions. [2019-12-18 12:36:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:36:55,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:36:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:36:55,879 INFO L225 Difference]: With dead ends: 21147 [2019-12-18 12:36:55,879 INFO L226 Difference]: Without dead ends: 21147 [2019-12-18 12:36:55,879 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 12:36:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21147 states. [2019-12-18 12:36:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21147 to 19443. [2019-12-18 12:36:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19443 states. [2019-12-18 12:36:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 58635 transitions. [2019-12-18 12:36:56,284 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 58635 transitions. Word has length 66 [2019-12-18 12:36:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:36:56,284 INFO L462 AbstractCegarLoop]: Abstraction has 19443 states and 58635 transitions. [2019-12-18 12:36:56,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:36:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 58635 transitions. [2019-12-18 12:36:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:36:56,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:36:56,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:36:56,303 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:36:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:36:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-18 12:36:56,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:36:56,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966901562] [2019-12-18 12:36:56,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:36:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:36:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:36:56,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:36:56,435 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:36:56,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= v_~z$r_buff1_thd1~0_114 0) (= 0 |v_ULTIMATE.start_main_~#t427~0.offset_30|) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t427~0.base_44| 4) |v_#length_23|) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t427~0.base_44|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t427~0.base_44| 1) |v_#valid_71|) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= v_~main$tmp_guard0~0_44 0) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t427~0.base_44|) (= v_~__unbuffered_p2_EBX~0_54 0) (= v_~z$r_buff1_thd0~0_148 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t427~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t427~0.base_44|) |v_ULTIMATE.start_main_~#t427~0.offset_30| 0)) |v_#memory_int_21|) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_~#t428~0.offset=|v_ULTIMATE.start_main_~#t428~0.offset_30|, ULTIMATE.start_main_~#t429~0.base=|v_ULTIMATE.start_main_~#t429~0.base_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_~#t427~0.base=|v_ULTIMATE.start_main_~#t427~0.base_44|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ULTIMATE.start_main_~#t427~0.offset=|v_ULTIMATE.start_main_~#t427~0.offset_30|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ULTIMATE.start_main_~#t429~0.offset=|v_ULTIMATE.start_main_~#t429~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t428~0.base=|v_ULTIMATE.start_main_~#t428~0.base_44|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t428~0.offset, ULTIMATE.start_main_~#t429~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t427~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t427~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t429~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t428~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:36:56,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff0_thd2~0_In1089387926 ~z$r_buff1_thd2~0_Out1089387926) (= ~z$r_buff1_thd0~0_Out1089387926 ~z$r_buff0_thd0~0_In1089387926) (= 1 ~z$r_buff0_thd1~0_Out1089387926) (= ~z$r_buff0_thd1~0_In1089387926 ~z$r_buff1_thd1~0_Out1089387926) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1089387926)) (= ~z$r_buff0_thd3~0_In1089387926 ~z$r_buff1_thd3~0_Out1089387926) (= ~x~0_In1089387926 ~__unbuffered_p0_EAX~0_Out1089387926)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1089387926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1089387926, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1089387926, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1089387926, ~x~0=~x~0_In1089387926, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1089387926} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1089387926, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1089387926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1089387926, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1089387926, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1089387926, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1089387926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1089387926, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1089387926, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1089387926, ~x~0=~x~0_In1089387926, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1089387926} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:36:56,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t428~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t428~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t428~0.base_13|) |v_ULTIMATE.start_main_~#t428~0.offset_11| 1)) |v_#memory_int_13|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t428~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t428~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t428~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t428~0.base_13| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t428~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t428~0.offset=|v_ULTIMATE.start_main_~#t428~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t428~0.base=|v_ULTIMATE.start_main_~#t428~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t428~0.offset, #length, ULTIMATE.start_main_~#t428~0.base] because there is no mapped edge [2019-12-18 12:36:56,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1029875404 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1029875404 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out-1029875404| |P1Thread1of1ForFork2_#t~ite9_Out-1029875404|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1029875404| ~z~0_In-1029875404) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1029875404| ~z$w_buff1~0_In-1029875404) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1029875404, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1029875404, ~z$w_buff1~0=~z$w_buff1~0_In-1029875404, ~z~0=~z~0_In-1029875404} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1029875404|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1029875404, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1029875404|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1029875404, ~z$w_buff1~0=~z$w_buff1~0_In-1029875404, ~z~0=~z~0_In-1029875404} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:36:56,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-967658984 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-967658984 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-967658984|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-967658984 |P1Thread1of1ForFork2_#t~ite11_Out-967658984|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-967658984, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-967658984} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-967658984, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-967658984|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-967658984} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:36:56,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1253278156 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1253278156 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1253278156 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1253278156 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1253278156| ~z$w_buff1_used~0_In-1253278156) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1253278156| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1253278156, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1253278156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1253278156, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1253278156} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1253278156, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1253278156, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1253278156, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1253278156|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1253278156} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:36:56,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t429~0.base_10| 1) |v_#valid_32|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t429~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t429~0.base_10|) (= |v_ULTIMATE.start_main_~#t429~0.offset_9| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t429~0.base_10| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t429~0.base_10| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t429~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t429~0.base_10|) |v_ULTIMATE.start_main_~#t429~0.offset_9| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t429~0.offset=|v_ULTIMATE.start_main_~#t429~0.offset_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t429~0.base=|v_ULTIMATE.start_main_~#t429~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t429~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t429~0.base] because there is no mapped edge [2019-12-18 12:36:56,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1698691646 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1698691646| ~z$w_buff0~0_In-1698691646) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1698691646 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1698691646 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1698691646 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1698691646 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite21_Out-1698691646| |P2Thread1of1ForFork0_#t~ite20_Out-1698691646|)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1698691646| ~z$w_buff0~0_In-1698691646) (= |P2Thread1of1ForFork0_#t~ite20_In-1698691646| |P2Thread1of1ForFork0_#t~ite20_Out-1698691646|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1698691646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698691646, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1698691646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1698691646, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1698691646, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1698691646|, ~weak$$choice2~0=~weak$$choice2~0_In-1698691646} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1698691646|, ~z$w_buff0~0=~z$w_buff0~0_In-1698691646, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1698691646, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1698691646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1698691646, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1698691646, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1698691646|, ~weak$$choice2~0=~weak$$choice2~0_In-1698691646} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:36:56,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1464999768 256)))) (or (and (= ~z$w_buff1~0_In-1464999768 |P2Thread1of1ForFork0_#t~ite24_Out-1464999768|) (= |P2Thread1of1ForFork0_#t~ite23_In-1464999768| |P2Thread1of1ForFork0_#t~ite23_Out-1464999768|) (not .cse0)) (and (= ~z$w_buff1~0_In-1464999768 |P2Thread1of1ForFork0_#t~ite23_Out-1464999768|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1464999768 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1464999768 256))) (and (= (mod ~z$w_buff1_used~0_In-1464999768 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-1464999768 256) 0))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1464999768| |P2Thread1of1ForFork0_#t~ite23_Out-1464999768|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1464999768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1464999768, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1464999768|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1464999768, ~z$w_buff1~0=~z$w_buff1~0_In-1464999768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1464999768, ~weak$$choice2~0=~weak$$choice2~0_In-1464999768} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1464999768, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1464999768|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1464999768, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1464999768|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1464999768, ~z$w_buff1~0=~z$w_buff1~0_In-1464999768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1464999768, ~weak$$choice2~0=~weak$$choice2~0_In-1464999768} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:36:56,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:36:56,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:36:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-65656275 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-65656275 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-65656275| ~z~0_In-65656275)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-65656275| ~z$w_buff1~0_In-65656275) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-65656275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65656275, ~z$w_buff1~0=~z$w_buff1~0_In-65656275, ~z~0=~z~0_In-65656275} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-65656275|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-65656275, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-65656275, ~z$w_buff1~0=~z$w_buff1~0_In-65656275, ~z~0=~z~0_In-65656275} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:36:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:36:56,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1982130098 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1982130098 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1982130098| ~z$w_buff0_used~0_In-1982130098) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1982130098| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1982130098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1982130098} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1982130098, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1982130098|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1982130098} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:36:56,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1297091639 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1297091639 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1297091639| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1297091639 |P1Thread1of1ForFork2_#t~ite13_Out-1297091639|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1297091639, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1297091639} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1297091639, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1297091639|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1297091639} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:36:56,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-969755559 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-969755559 256)))) (or (and (= ~z$w_buff0_used~0_In-969755559 |P0Thread1of1ForFork1_#t~ite5_Out-969755559|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-969755559| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-969755559, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-969755559} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-969755559|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-969755559, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-969755559} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:36:56,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In754812098 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In754812098 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In754812098 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In754812098 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out754812098| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In754812098 |P0Thread1of1ForFork1_#t~ite6_Out754812098|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In754812098, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In754812098, ~z$w_buff1_used~0=~z$w_buff1_used~0_In754812098, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In754812098} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In754812098, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out754812098|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In754812098, ~z$w_buff1_used~0=~z$w_buff1_used~0_In754812098, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In754812098} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:36:56,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1437124185 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1437124185 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1437124185) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In1437124185 ~z$r_buff0_thd1~0_Out1437124185)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1437124185, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1437124185} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1437124185, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1437124185|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1437124185} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:36:56,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In827864767 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In827864767 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In827864767 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In827864767 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out827864767| ~z$r_buff1_thd1~0_In827864767)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out827864767|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In827864767, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In827864767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In827864767, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In827864767} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out827864767|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In827864767, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In827864767, ~z$w_buff1_used~0=~z$w_buff1_used~0_In827864767, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In827864767} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:36:56,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_23|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:36:56,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-190460908 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-190460908 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-190460908 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-190460908 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-190460908|)) (and (= ~z$w_buff1_used~0_In-190460908 |P2Thread1of1ForFork0_#t~ite41_Out-190460908|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-190460908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-190460908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-190460908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-190460908} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-190460908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-190460908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-190460908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-190460908, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-190460908|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:36:56,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1057156084 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1057156084 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1057156084| ~z$r_buff0_thd3~0_In-1057156084)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1057156084|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1057156084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1057156084} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1057156084, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1057156084, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1057156084|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:36:56,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1898529334 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1898529334 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1898529334 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1898529334 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In1898529334 |P2Thread1of1ForFork0_#t~ite43_Out1898529334|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1898529334|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1898529334, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1898529334, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1898529334, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1898529334} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1898529334|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1898529334, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1898529334, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1898529334, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1898529334} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:36:56,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_26|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:36:56,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1445849808 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1445849808 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1445849808 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1445849808 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1445849808| ~z$r_buff1_thd2~0_In-1445849808) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out-1445849808| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1445849808, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1445849808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1445849808, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1445849808} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1445849808, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1445849808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1445849808, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1445849808|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1445849808} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:36:56,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_26| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_26|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_25|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:36:56,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:36:56,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1411417450 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1411417450 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1411417450 |ULTIMATE.start_main_#t~ite47_Out-1411417450|)) (and (or .cse1 .cse0) (= ~z~0_In-1411417450 |ULTIMATE.start_main_#t~ite47_Out-1411417450|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1411417450, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411417450, ~z$w_buff1~0=~z$w_buff1~0_In-1411417450, ~z~0=~z~0_In-1411417450} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1411417450, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1411417450|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1411417450, ~z$w_buff1~0=~z$w_buff1~0_In-1411417450, ~z~0=~z~0_In-1411417450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:36:56,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-18 12:36:56,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In275639503 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In275639503 256) 0))) (or (and (= ~z$w_buff0_used~0_In275639503 |ULTIMATE.start_main_#t~ite49_Out275639503|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out275639503|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275639503, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275639503} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In275639503, ~z$w_buff0_used~0=~z$w_buff0_used~0_In275639503, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out275639503|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:36:56,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1193770334 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1193770334 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1193770334 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1193770334 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1193770334|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1193770334 |ULTIMATE.start_main_#t~ite50_Out-1193770334|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1193770334, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1193770334, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1193770334, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1193770334} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1193770334|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1193770334, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1193770334, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1193770334, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1193770334} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:36:56,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1686410356 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1686410356 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1686410356| 0)) (and (= ~z$r_buff0_thd0~0_In1686410356 |ULTIMATE.start_main_#t~ite51_Out1686410356|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1686410356, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1686410356} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1686410356, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1686410356|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1686410356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:36:56,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In726261428 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In726261428 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In726261428 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In726261428 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In726261428 |ULTIMATE.start_main_#t~ite52_Out726261428|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out726261428|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In726261428, ~z$w_buff0_used~0=~z$w_buff0_used~0_In726261428, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In726261428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In726261428} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out726261428|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In726261428, ~z$w_buff0_used~0=~z$w_buff0_used~0_In726261428, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In726261428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In726261428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:36:56,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~__unbuffered_p2_EBX~0_32 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~main$tmp_guard1~0_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:36:56,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:36:56 BasicIcfg [2019-12-18 12:36:56,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:36:56,597 INFO L168 Benchmark]: Toolchain (without parser) took 107372.23 ms. Allocated memory was 148.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 105.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,598 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 148.9 MB. Free memory was 125.2 MB in the beginning and 125.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.48 ms. Allocated memory was 148.9 MB in the beginning and 205.5 MB in the end (delta: 56.6 MB). Free memory was 105.0 MB in the beginning and 158.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.62 ms. Allocated memory is still 205.5 MB. Free memory was 158.5 MB in the beginning and 156.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,599 INFO L168 Benchmark]: Boogie Preprocessor took 40.95 ms. Allocated memory is still 205.5 MB. Free memory was 156.0 MB in the beginning and 153.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,600 INFO L168 Benchmark]: RCFGBuilder took 921.39 ms. Allocated memory is still 205.5 MB. Free memory was 153.5 MB in the beginning and 103.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,606 INFO L168 Benchmark]: TraceAbstraction took 105536.07 ms. Allocated memory was 205.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 12:36:56,608 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.24 ms. Allocated memory is still 148.9 MB. Free memory was 125.2 MB in the beginning and 125.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.48 ms. Allocated memory was 148.9 MB in the beginning and 205.5 MB in the end (delta: 56.6 MB). Free memory was 105.0 MB in the beginning and 158.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.62 ms. Allocated memory is still 205.5 MB. Free memory was 158.5 MB in the beginning and 156.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.95 ms. Allocated memory is still 205.5 MB. Free memory was 156.0 MB in the beginning and 153.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 921.39 ms. Allocated memory is still 205.5 MB. Free memory was 153.5 MB in the beginning and 103.7 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105536.07 ms. Allocated memory was 205.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.1 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t427, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t428, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t429, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 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 [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.1s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6714 SDtfs, 8678 SDslu, 16561 SDs, 0 SdLazy, 9231 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 59 SyntacticMatches, 29 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143879occurred 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: 49.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 400727 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1263 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1165 ConstructedInterpolants, 0 QuantifiedInterpolants, 208871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...