/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:58:58,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:58:58,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:58:58,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:58:58,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:58:58,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:58:58,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:58:58,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:58:58,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:58:58,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:58:58,969 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:58:58,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:58:58,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:58:58,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:58:58,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:58:58,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:58:58,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:58:58,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:58:58,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:58:58,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:58:58,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:58:58,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:58:58,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:58:58,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:58:58,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:58:58,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:58:58,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:58:58,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:58:58,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:58:58,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:58:58,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:58:58,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:58:58,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:58:58,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:58:58,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:58:58,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:58:58,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:58:58,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:58:58,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:58:58,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:58:58,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:58:58,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:58:59,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:58:59,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:58:59,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:58:59,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:58:59,034 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:58:59,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:58:59,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:58:59,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:58:59,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:58:59,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:58:59,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:58:59,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:58:59,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:58:59,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:58:59,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:58:59,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:58:59,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:58:59,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:58:59,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:58:59,038 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:58:59,040 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:58:59,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:58:59,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:58:59,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:58:59,041 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:58:59,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:58:59,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:58:59,042 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:58:59,042 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:58:59,042 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:58:59,043 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:58:59,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:58:59,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:58:59,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:58:59,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:58:59,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:58:59,342 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:58:59,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i [2019-12-27 20:58:59,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc6c413b/f673aeb827804cdaa4ad495728b4a065/FLAG94596774e [2019-12-27 20:58:59,978 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:58:59,980 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.oepc.i [2019-12-27 20:59:00,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc6c413b/f673aeb827804cdaa4ad495728b4a065/FLAG94596774e [2019-12-27 20:59:00,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc6c413b/f673aeb827804cdaa4ad495728b4a065 [2019-12-27 20:59:00,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:59:00,254 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:59:00,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:59:00,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:59:00,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:59:00,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:59:00" (1/1) ... [2019-12-27 20:59:00,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:00, skipping insertion in model container [2019-12-27 20:59:00,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:59:00" (1/1) ... [2019-12-27 20:59:00,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:59:00,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:59:00,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:59:00,859 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:59:00,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:59:01,010 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:59:01,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01 WrapperNode [2019-12-27 20:59:01,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:59:01,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:59:01,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:59:01,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:59:01,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:59:01,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:59:01,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:59:01,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:59:01,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... [2019-12-27 20:59:01,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:59:01,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:59:01,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:59:01,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:59:01,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:59:01,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:59:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:59:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:59:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:59:01,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:59:01,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:59:01,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:59:01,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:59:01,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:59:01,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:59:01,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:59:01,193 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:59:02,031 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:59:02,032 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:59:02,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:59:02 BoogieIcfgContainer [2019-12-27 20:59:02,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:59:02,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:59:02,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:59:02,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:59:02,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:59:00" (1/3) ... [2019-12-27 20:59:02,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631c1f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:59:02, skipping insertion in model container [2019-12-27 20:59:02,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:59:01" (2/3) ... [2019-12-27 20:59:02,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631c1f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:59:02, skipping insertion in model container [2019-12-27 20:59:02,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:59:02" (3/3) ... [2019-12-27 20:59:02,043 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.oepc.i [2019-12-27 20:59:02,055 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:59:02,055 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:59:02,063 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:59:02,064 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:59:02,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,110 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,136 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,145 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,145 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,188 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,189 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,190 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,198 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,215 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:59:02,241 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:59:02,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:59:02,265 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:59:02,265 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:59:02,265 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:59:02,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:59:02,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:59:02,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:59:02,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:59:02,292 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 20:59:02,294 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 20:59:02,431 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 20:59:02,432 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:59:02,451 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:59:02,474 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 20:59:02,536 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 20:59:02,536 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:59:02,544 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 20:59:02,564 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 20:59:02,565 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:59:06,128 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:59:06,258 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:59:06,290 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86659 [2019-12-27 20:59:06,290 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 20:59:06,294 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 20:59:26,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 20:59:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 20:59:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:59:26,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:59:26,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:59:26,880 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:59:26,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:59:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash 916959, now seen corresponding path program 1 times [2019-12-27 20:59:26,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:59:26,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924853547] [2019-12-27 20:59:26,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:59:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:59:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:59:27,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924853547] [2019-12-27 20:59:27,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:59:27,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:59:27,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [577633775] [2019-12-27 20:59:27,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:59:27,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:59:27,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:59:27,192 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:59:27,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:59:27,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:59:27,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:59:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:59:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:59:27,215 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 20:59:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:59:28,675 INFO L93 Difference]: Finished difference Result 123002 states and 528862 transitions. [2019-12-27 20:59:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:59:28,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:59:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:59:29,360 INFO L225 Difference]: With dead ends: 123002 [2019-12-27 20:59:29,361 INFO L226 Difference]: Without dead ends: 115358 [2019-12-27 20:59:29,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:59:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115358 states. [2019-12-27 20:59:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115358 to 115358. [2019-12-27 20:59:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115358 states. [2019-12-27 20:59:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115358 states to 115358 states and 495332 transitions. [2019-12-27 20:59:41,436 INFO L78 Accepts]: Start accepts. Automaton has 115358 states and 495332 transitions. Word has length 3 [2019-12-27 20:59:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:59:41,436 INFO L462 AbstractCegarLoop]: Abstraction has 115358 states and 495332 transitions. [2019-12-27 20:59:41,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:59:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 115358 states and 495332 transitions. [2019-12-27 20:59:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:59:41,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:59:41,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:59:41,444 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:59:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:59:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1587788746, now seen corresponding path program 1 times [2019-12-27 20:59:41,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:59:41,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893746032] [2019-12-27 20:59:41,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:59:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:59:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:59:41,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893746032] [2019-12-27 20:59:41,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:59:41,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:59:41,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259546934] [2019-12-27 20:59:41,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:59:41,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:59:41,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:59:41,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:59:41,545 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:59:41,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:59:41,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:59:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:59:41,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:59:41,548 INFO L87 Difference]: Start difference. First operand 115358 states and 495332 transitions. Second operand 4 states. [2019-12-27 20:59:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:59:47,185 INFO L93 Difference]: Finished difference Result 179368 states and 739568 transitions. [2019-12-27 20:59:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:59:47,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 20:59:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:59:47,829 INFO L225 Difference]: With dead ends: 179368 [2019-12-27 20:59:47,829 INFO L226 Difference]: Without dead ends: 179319 [2019-12-27 20:59:47,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:59:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179319 states. [2019-12-27 21:00:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179319 to 163842. [2019-12-27 21:00:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163842 states. [2019-12-27 21:00:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163842 states to 163842 states and 684578 transitions. [2019-12-27 21:00:07,852 INFO L78 Accepts]: Start accepts. Automaton has 163842 states and 684578 transitions. Word has length 11 [2019-12-27 21:00:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:07,853 INFO L462 AbstractCegarLoop]: Abstraction has 163842 states and 684578 transitions. [2019-12-27 21:00:07,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 163842 states and 684578 transitions. [2019-12-27 21:00:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:00:07,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:07,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:07,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 245340836, now seen corresponding path program 1 times [2019-12-27 21:00:07,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:07,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867397248] [2019-12-27 21:00:07,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:07,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867397248] [2019-12-27 21:00:07,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:07,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:07,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107368609] [2019-12-27 21:00:07,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:07,936 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:07,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:00:07,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:07,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:07,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:07,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:07,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:07,939 INFO L87 Difference]: Start difference. First operand 163842 states and 684578 transitions. Second operand 3 states. [2019-12-27 21:00:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:08,093 INFO L93 Difference]: Finished difference Result 35474 states and 116324 transitions. [2019-12-27 21:00:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:08,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:00:08,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:08,156 INFO L225 Difference]: With dead ends: 35474 [2019-12-27 21:00:08,156 INFO L226 Difference]: Without dead ends: 35474 [2019-12-27 21:00:08,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35474 states. [2019-12-27 21:00:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35474 to 35474. [2019-12-27 21:00:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35474 states. [2019-12-27 21:00:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35474 states to 35474 states and 116324 transitions. [2019-12-27 21:00:08,847 INFO L78 Accepts]: Start accepts. Automaton has 35474 states and 116324 transitions. Word has length 13 [2019-12-27 21:00:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:08,847 INFO L462 AbstractCegarLoop]: Abstraction has 35474 states and 116324 transitions. [2019-12-27 21:00:08,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35474 states and 116324 transitions. [2019-12-27 21:00:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:00:08,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:08,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:08,851 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:08,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1764199357, now seen corresponding path program 1 times [2019-12-27 21:00:08,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:08,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785828904] [2019-12-27 21:00:08,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:08,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785828904] [2019-12-27 21:00:08,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:08,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:08,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [342150841] [2019-12-27 21:00:08,935 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:08,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:08,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:00:08,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:08,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:08,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:08,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:08,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:08,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:08,942 INFO L87 Difference]: Start difference. First operand 35474 states and 116324 transitions. Second operand 3 states. [2019-12-27 21:00:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:09,171 INFO L93 Difference]: Finished difference Result 53873 states and 176061 transitions. [2019-12-27 21:00:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:09,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:00:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:09,267 INFO L225 Difference]: With dead ends: 53873 [2019-12-27 21:00:09,267 INFO L226 Difference]: Without dead ends: 53873 [2019-12-27 21:00:09,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53873 states. [2019-12-27 21:00:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53873 to 40386. [2019-12-27 21:00:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40386 states. [2019-12-27 21:00:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40386 states to 40386 states and 133919 transitions. [2019-12-27 21:00:11,139 INFO L78 Accepts]: Start accepts. Automaton has 40386 states and 133919 transitions. Word has length 16 [2019-12-27 21:00:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:11,141 INFO L462 AbstractCegarLoop]: Abstraction has 40386 states and 133919 transitions. [2019-12-27 21:00:11,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 40386 states and 133919 transitions. [2019-12-27 21:00:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:00:11,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:11,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:11,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1679414171, now seen corresponding path program 1 times [2019-12-27 21:00:11,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:11,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084258883] [2019-12-27 21:00:11,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:11,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084258883] [2019-12-27 21:00:11,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:11,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:11,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708934664] [2019-12-27 21:00:11,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:11,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:11,208 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:00:11,208 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:11,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:11,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:11,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:11,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:11,209 INFO L87 Difference]: Start difference. First operand 40386 states and 133919 transitions. Second operand 4 states. [2019-12-27 21:00:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:11,575 INFO L93 Difference]: Finished difference Result 48153 states and 157153 transitions. [2019-12-27 21:00:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:11,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:00:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:11,678 INFO L225 Difference]: With dead ends: 48153 [2019-12-27 21:00:11,678 INFO L226 Difference]: Without dead ends: 48153 [2019-12-27 21:00:11,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48153 states. [2019-12-27 21:00:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48153 to 44290. [2019-12-27 21:00:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44290 states. [2019-12-27 21:00:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44290 states to 44290 states and 145673 transitions. [2019-12-27 21:00:13,067 INFO L78 Accepts]: Start accepts. Automaton has 44290 states and 145673 transitions. Word has length 16 [2019-12-27 21:00:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:13,068 INFO L462 AbstractCegarLoop]: Abstraction has 44290 states and 145673 transitions. [2019-12-27 21:00:13,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44290 states and 145673 transitions. [2019-12-27 21:00:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:00:13,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:13,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:13,072 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1745863415, now seen corresponding path program 1 times [2019-12-27 21:00:13,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:13,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368798213] [2019-12-27 21:00:13,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:13,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368798213] [2019-12-27 21:00:13,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:13,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:13,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [524184419] [2019-12-27 21:00:13,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:13,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:13,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:00:13,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:13,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:13,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:13,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:13,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:13,165 INFO L87 Difference]: Start difference. First operand 44290 states and 145673 transitions. Second operand 4 states. [2019-12-27 21:00:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:13,564 INFO L93 Difference]: Finished difference Result 52593 states and 171527 transitions. [2019-12-27 21:00:13,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:13,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:00:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:13,648 INFO L225 Difference]: With dead ends: 52593 [2019-12-27 21:00:13,649 INFO L226 Difference]: Without dead ends: 52593 [2019-12-27 21:00:13,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52593 states. [2019-12-27 21:00:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52593 to 45862. [2019-12-27 21:00:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-12-27 21:00:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 150892 transitions. [2019-12-27 21:00:15,268 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 150892 transitions. Word has length 16 [2019-12-27 21:00:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:15,269 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 150892 transitions. [2019-12-27 21:00:15,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 150892 transitions. [2019-12-27 21:00:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:00:15,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:15,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] [2019-12-27 21:00:15,279 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1921236917, now seen corresponding path program 1 times [2019-12-27 21:00:15,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:15,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050539873] [2019-12-27 21:00:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:15,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050539873] [2019-12-27 21:00:15,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:15,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:15,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1009568511] [2019-12-27 21:00:15,417 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:15,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:15,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:00:15,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:15,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:15,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:15,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:15,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:15,433 INFO L87 Difference]: Start difference. First operand 45862 states and 150892 transitions. Second operand 5 states. [2019-12-27 21:00:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:16,141 INFO L93 Difference]: Finished difference Result 62673 states and 200938 transitions. [2019-12-27 21:00:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:00:16,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:00:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:16,252 INFO L225 Difference]: With dead ends: 62673 [2019-12-27 21:00:16,252 INFO L226 Difference]: Without dead ends: 62666 [2019-12-27 21:00:16,252 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-27 21:00:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62666 states. [2019-12-27 21:00:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62666 to 47202. [2019-12-27 21:00:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47202 states. [2019-12-27 21:00:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47202 states to 47202 states and 154985 transitions. [2019-12-27 21:00:17,243 INFO L78 Accepts]: Start accepts. Automaton has 47202 states and 154985 transitions. Word has length 22 [2019-12-27 21:00:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:17,243 INFO L462 AbstractCegarLoop]: Abstraction has 47202 states and 154985 transitions. [2019-12-27 21:00:17,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 47202 states and 154985 transitions. [2019-12-27 21:00:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:00:17,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:17,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:17,254 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1854787673, now seen corresponding path program 1 times [2019-12-27 21:00:17,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:17,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839543827] [2019-12-27 21:00:17,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:17,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839543827] [2019-12-27 21:00:17,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:17,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:17,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1834721803] [2019-12-27 21:00:17,324 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:17,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:17,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:00:17,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:17,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:17,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:17,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:17,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:17,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:17,334 INFO L87 Difference]: Start difference. First operand 47202 states and 154985 transitions. Second operand 5 states. [2019-12-27 21:00:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:18,499 INFO L93 Difference]: Finished difference Result 65940 states and 210721 transitions. [2019-12-27 21:00:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:00:18,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 21:00:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:18,609 INFO L225 Difference]: With dead ends: 65940 [2019-12-27 21:00:18,610 INFO L226 Difference]: Without dead ends: 65933 [2019-12-27 21:00:18,610 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-27 21:00:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65933 states. [2019-12-27 21:00:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65933 to 45465. [2019-12-27 21:00:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45465 states. [2019-12-27 21:00:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45465 states to 45465 states and 149394 transitions. [2019-12-27 21:00:19,561 INFO L78 Accepts]: Start accepts. Automaton has 45465 states and 149394 transitions. Word has length 22 [2019-12-27 21:00:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:19,562 INFO L462 AbstractCegarLoop]: Abstraction has 45465 states and 149394 transitions. [2019-12-27 21:00:19,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 45465 states and 149394 transitions. [2019-12-27 21:00:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:00:19,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:19,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:19,574 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash 145172187, now seen corresponding path program 1 times [2019-12-27 21:00:19,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:19,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918220975] [2019-12-27 21:00:19,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:19,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918220975] [2019-12-27 21:00:19,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:19,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:19,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1397878357] [2019-12-27 21:00:19,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:19,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:19,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:00:19,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:19,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:19,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:19,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:19,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:19,639 INFO L87 Difference]: Start difference. First operand 45465 states and 149394 transitions. Second operand 4 states. [2019-12-27 21:00:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:19,721 INFO L93 Difference]: Finished difference Result 18727 states and 58359 transitions. [2019-12-27 21:00:19,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:00:19,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:00:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:19,747 INFO L225 Difference]: With dead ends: 18727 [2019-12-27 21:00:19,747 INFO L226 Difference]: Without dead ends: 18727 [2019-12-27 21:00:19,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2019-12-27 21:00:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18364. [2019-12-27 21:00:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 21:00:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 57323 transitions. [2019-12-27 21:00:20,043 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 57323 transitions. Word has length 25 [2019-12-27 21:00:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:20,044 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 57323 transitions. [2019-12-27 21:00:20,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:20,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 57323 transitions. [2019-12-27 21:00:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:00:20,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:20,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:20,058 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2016642455, now seen corresponding path program 1 times [2019-12-27 21:00:20,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:20,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105788629] [2019-12-27 21:00:20,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:20,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105788629] [2019-12-27 21:00:20,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:20,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:20,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055043861] [2019-12-27 21:00:20,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:20,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:20,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:00:20,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:20,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:20,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:20,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:20,115 INFO L87 Difference]: Start difference. First operand 18364 states and 57323 transitions. Second operand 3 states. [2019-12-27 21:00:20,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:20,251 INFO L93 Difference]: Finished difference Result 24105 states and 71434 transitions. [2019-12-27 21:00:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:20,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 21:00:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:20,295 INFO L225 Difference]: With dead ends: 24105 [2019-12-27 21:00:20,295 INFO L226 Difference]: Without dead ends: 24105 [2019-12-27 21:00:20,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24105 states. [2019-12-27 21:00:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24105 to 18364. [2019-12-27 21:00:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-12-27 21:00:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 54802 transitions. [2019-12-27 21:00:20,954 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 54802 transitions. Word has length 27 [2019-12-27 21:00:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 54802 transitions. [2019-12-27 21:00:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 54802 transitions. [2019-12-27 21:00:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:00:20,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:20,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:20,968 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash -364349975, now seen corresponding path program 1 times [2019-12-27 21:00:20,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:20,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568571328] [2019-12-27 21:00:20,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:21,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568571328] [2019-12-27 21:00:21,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:21,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:21,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1414884820] [2019-12-27 21:00:21,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:21,034 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:21,039 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:00:21,039 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:21,040 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:21,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:21,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:21,041 INFO L87 Difference]: Start difference. First operand 18364 states and 54802 transitions. Second operand 5 states. [2019-12-27 21:00:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:21,435 INFO L93 Difference]: Finished difference Result 22570 states and 66509 transitions. [2019-12-27 21:00:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:00:21,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 21:00:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:21,466 INFO L225 Difference]: With dead ends: 22570 [2019-12-27 21:00:21,466 INFO L226 Difference]: Without dead ends: 22570 [2019-12-27 21:00:21,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22570 states. [2019-12-27 21:00:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22570 to 21200. [2019-12-27 21:00:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21200 states. [2019-12-27 21:00:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21200 states to 21200 states and 63046 transitions. [2019-12-27 21:00:21,806 INFO L78 Accepts]: Start accepts. Automaton has 21200 states and 63046 transitions. Word has length 27 [2019-12-27 21:00:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:21,807 INFO L462 AbstractCegarLoop]: Abstraction has 21200 states and 63046 transitions. [2019-12-27 21:00:21,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 21200 states and 63046 transitions. [2019-12-27 21:00:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:00:21,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:21,823 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-27 21:00:21,823 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:21,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash 587647727, now seen corresponding path program 1 times [2019-12-27 21:00:21,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:21,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79062046] [2019-12-27 21:00:21,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:21,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79062046] [2019-12-27 21:00:21,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:21,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:21,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599268781] [2019-12-27 21:00:21,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:21,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:21,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:00:21,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:21,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:21,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:21,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:21,906 INFO L87 Difference]: Start difference. First operand 21200 states and 63046 transitions. Second operand 5 states. [2019-12-27 21:00:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:22,296 INFO L93 Difference]: Finished difference Result 24672 states and 72522 transitions. [2019-12-27 21:00:22,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:00:22,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 21:00:22,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:22,343 INFO L225 Difference]: With dead ends: 24672 [2019-12-27 21:00:22,343 INFO L226 Difference]: Without dead ends: 24672 [2019-12-27 21:00:22,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24672 states. [2019-12-27 21:00:22,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24672 to 21106. [2019-12-27 21:00:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21106 states. [2019-12-27 21:00:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21106 states to 21106 states and 62614 transitions. [2019-12-27 21:00:22,714 INFO L78 Accepts]: Start accepts. Automaton has 21106 states and 62614 transitions. Word has length 28 [2019-12-27 21:00:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:22,714 INFO L462 AbstractCegarLoop]: Abstraction has 21106 states and 62614 transitions. [2019-12-27 21:00:22,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 21106 states and 62614 transitions. [2019-12-27 21:00:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:00:22,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:22,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:22,736 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash 688173209, now seen corresponding path program 1 times [2019-12-27 21:00:22,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:22,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324775787] [2019-12-27 21:00:22,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:22,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324775787] [2019-12-27 21:00:22,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:22,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:00:22,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690937473] [2019-12-27 21:00:22,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:22,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:22,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 21:00:22,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:22,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:22,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:00:22,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:00:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:00:22,824 INFO L87 Difference]: Start difference. First operand 21106 states and 62614 transitions. Second operand 6 states. [2019-12-27 21:00:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:23,517 INFO L93 Difference]: Finished difference Result 28374 states and 82992 transitions. [2019-12-27 21:00:23,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:00:23,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 21:00:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:23,555 INFO L225 Difference]: With dead ends: 28374 [2019-12-27 21:00:23,556 INFO L226 Difference]: Without dead ends: 28374 [2019-12-27 21:00:23,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:00:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28374 states. [2019-12-27 21:00:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28374 to 22550. [2019-12-27 21:00:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22550 states. [2019-12-27 21:00:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22550 states to 22550 states and 66975 transitions. [2019-12-27 21:00:24,293 INFO L78 Accepts]: Start accepts. Automaton has 22550 states and 66975 transitions. Word has length 33 [2019-12-27 21:00:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:24,294 INFO L462 AbstractCegarLoop]: Abstraction has 22550 states and 66975 transitions. [2019-12-27 21:00:24,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:00:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22550 states and 66975 transitions. [2019-12-27 21:00:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:00:24,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:24,314 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] [2019-12-27 21:00:24,314 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1143871937, now seen corresponding path program 1 times [2019-12-27 21:00:24,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:24,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232874014] [2019-12-27 21:00:24,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:24,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232874014] [2019-12-27 21:00:24,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:24,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:00:24,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696352599] [2019-12-27 21:00:24,410 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:24,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:24,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 21:00:24,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:24,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:24,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:00:24,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:24,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:00:24,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:00:24,433 INFO L87 Difference]: Start difference. First operand 22550 states and 66975 transitions. Second operand 6 states. [2019-12-27 21:00:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:25,141 INFO L93 Difference]: Finished difference Result 27535 states and 80686 transitions. [2019-12-27 21:00:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:00:25,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 21:00:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:25,195 INFO L225 Difference]: With dead ends: 27535 [2019-12-27 21:00:25,195 INFO L226 Difference]: Without dead ends: 27535 [2019-12-27 21:00:25,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 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-27 21:00:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27535 states. [2019-12-27 21:00:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27535 to 19269. [2019-12-27 21:00:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19269 states. [2019-12-27 21:00:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 57413 transitions. [2019-12-27 21:00:25,582 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 57413 transitions. Word has length 34 [2019-12-27 21:00:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:25,583 INFO L462 AbstractCegarLoop]: Abstraction has 19269 states and 57413 transitions. [2019-12-27 21:00:25,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:00:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 57413 transitions. [2019-12-27 21:00:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:00:25,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:25,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:25,603 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:25,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1024843726, now seen corresponding path program 1 times [2019-12-27 21:00:25,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:25,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218028316] [2019-12-27 21:00:25,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:25,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218028316] [2019-12-27 21:00:25,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:25,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:00:25,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1382692691] [2019-12-27 21:00:25,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:25,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:25,721 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 21:00:25,721 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:25,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:00:25,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:25,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:25,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:25,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:25,724 INFO L87 Difference]: Start difference. First operand 19269 states and 57413 transitions. Second operand 3 states. [2019-12-27 21:00:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:25,804 INFO L93 Difference]: Finished difference Result 19268 states and 57411 transitions. [2019-12-27 21:00:25,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:25,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 21:00:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:25,829 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 21:00:25,829 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 21:00:25,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 21:00:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19268. [2019-12-27 21:00:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19268 states. [2019-12-27 21:00:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19268 states to 19268 states and 57411 transitions. [2019-12-27 21:00:26,126 INFO L78 Accepts]: Start accepts. Automaton has 19268 states and 57411 transitions. Word has length 39 [2019-12-27 21:00:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:26,127 INFO L462 AbstractCegarLoop]: Abstraction has 19268 states and 57411 transitions. [2019-12-27 21:00:26,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19268 states and 57411 transitions. [2019-12-27 21:00:26,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:00:26,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:26,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:26,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:26,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1293195895, now seen corresponding path program 1 times [2019-12-27 21:00:26,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:26,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010539460] [2019-12-27 21:00:26,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:26,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:26,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010539460] [2019-12-27 21:00:26,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:26,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:26,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000495847] [2019-12-27 21:00:26,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:26,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:26,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 21:00:26,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:26,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:00:26,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:26,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:26,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:26,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:26,338 INFO L87 Difference]: Start difference. First operand 19268 states and 57411 transitions. Second operand 3 states. [2019-12-27 21:00:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:26,423 INFO L93 Difference]: Finished difference Result 19268 states and 57334 transitions. [2019-12-27 21:00:26,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:26,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 21:00:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:26,455 INFO L225 Difference]: With dead ends: 19268 [2019-12-27 21:00:26,456 INFO L226 Difference]: Without dead ends: 19268 [2019-12-27 21:00:26,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-27 21:00:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 17219. [2019-12-27 21:00:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17219 states. [2019-12-27 21:00:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17219 states to 17219 states and 51708 transitions. [2019-12-27 21:00:27,099 INFO L78 Accepts]: Start accepts. Automaton has 17219 states and 51708 transitions. Word has length 40 [2019-12-27 21:00:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:27,099 INFO L462 AbstractCegarLoop]: Abstraction has 17219 states and 51708 transitions. [2019-12-27 21:00:27,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17219 states and 51708 transitions. [2019-12-27 21:00:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 21:00:27,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:27,122 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-27 21:00:27,122 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1998295176, now seen corresponding path program 1 times [2019-12-27 21:00:27,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:27,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032381410] [2019-12-27 21:00:27,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:27,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032381410] [2019-12-27 21:00:27,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:27,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:00:27,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515371287] [2019-12-27 21:00:27,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:27,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:27,313 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 417 transitions. [2019-12-27 21:00:27,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:27,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:00:27,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:00:27,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:00:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:27,319 INFO L87 Difference]: Start difference. First operand 17219 states and 51708 transitions. Second operand 5 states. [2019-12-27 21:00:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:27,403 INFO L93 Difference]: Finished difference Result 16023 states and 49133 transitions. [2019-12-27 21:00:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:27,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 21:00:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:27,432 INFO L225 Difference]: With dead ends: 16023 [2019-12-27 21:00:27,432 INFO L226 Difference]: Without dead ends: 16023 [2019-12-27 21:00:27,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:27,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16023 states. [2019-12-27 21:00:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16023 to 16023. [2019-12-27 21:00:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16023 states. [2019-12-27 21:00:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16023 states to 16023 states and 49133 transitions. [2019-12-27 21:00:27,703 INFO L78 Accepts]: Start accepts. Automaton has 16023 states and 49133 transitions. Word has length 41 [2019-12-27 21:00:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:27,703 INFO L462 AbstractCegarLoop]: Abstraction has 16023 states and 49133 transitions. [2019-12-27 21:00:27,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:00:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 16023 states and 49133 transitions. [2019-12-27 21:00:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:00:27,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:27,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:27,720 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1498292074, now seen corresponding path program 1 times [2019-12-27 21:00:27,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:27,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233740195] [2019-12-27 21:00:27,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:27,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233740195] [2019-12-27 21:00:27,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:27,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:27,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1970905478] [2019-12-27 21:00:27,809 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:27,834 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:28,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 597 transitions. [2019-12-27 21:00:28,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:28,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:00:28,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:00:28,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:28,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:00:28,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:00:28,097 INFO L87 Difference]: Start difference. First operand 16023 states and 49133 transitions. Second operand 8 states. [2019-12-27 21:00:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:29,951 INFO L93 Difference]: Finished difference Result 65034 states and 195243 transitions. [2019-12-27 21:00:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:00:29,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:00:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:30,024 INFO L225 Difference]: With dead ends: 65034 [2019-12-27 21:00:30,024 INFO L226 Difference]: Without dead ends: 50642 [2019-12-27 21:00:30,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:00:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50642 states. [2019-12-27 21:00:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50642 to 19456. [2019-12-27 21:00:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19456 states. [2019-12-27 21:00:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19456 states to 19456 states and 59789 transitions. [2019-12-27 21:00:30,980 INFO L78 Accepts]: Start accepts. Automaton has 19456 states and 59789 transitions. Word has length 65 [2019-12-27 21:00:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:30,980 INFO L462 AbstractCegarLoop]: Abstraction has 19456 states and 59789 transitions. [2019-12-27 21:00:30,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:00:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 19456 states and 59789 transitions. [2019-12-27 21:00:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:00:31,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:31,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:31,002 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1514990150, now seen corresponding path program 2 times [2019-12-27 21:00:31,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:31,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855937640] [2019-12-27 21:00:31,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:31,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855937640] [2019-12-27 21:00:31,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:31,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:31,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2129357304] [2019-12-27 21:00:31,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:31,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:31,557 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 370 states and 745 transitions. [2019-12-27 21:00:31,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:31,588 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:00:31,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:00:31,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:00:31,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:31,589 INFO L87 Difference]: Start difference. First operand 19456 states and 59789 transitions. Second operand 7 states. [2019-12-27 21:00:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:32,058 INFO L93 Difference]: Finished difference Result 51791 states and 156015 transitions. [2019-12-27 21:00:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:00:32,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 21:00:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:32,114 INFO L225 Difference]: With dead ends: 51791 [2019-12-27 21:00:32,115 INFO L226 Difference]: Without dead ends: 38002 [2019-12-27 21:00:32,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:00:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38002 states. [2019-12-27 21:00:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38002 to 23226. [2019-12-27 21:00:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23226 states. [2019-12-27 21:00:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23226 states to 23226 states and 70989 transitions. [2019-12-27 21:00:32,645 INFO L78 Accepts]: Start accepts. Automaton has 23226 states and 70989 transitions. Word has length 65 [2019-12-27 21:00:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:32,645 INFO L462 AbstractCegarLoop]: Abstraction has 23226 states and 70989 transitions. [2019-12-27 21:00:32,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:00:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 23226 states and 70989 transitions. [2019-12-27 21:00:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:00:32,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:32,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:32,671 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:32,671 INFO L82 PathProgramCache]: Analyzing trace with hash -118142618, now seen corresponding path program 3 times [2019-12-27 21:00:32,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:32,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549560556] [2019-12-27 21:00:32,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:32,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549560556] [2019-12-27 21:00:32,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:32,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:32,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145273289] [2019-12-27 21:00:32,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:32,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:33,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 21:00:33,347 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:33,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:00:33,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:00:33,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:00:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:00:33,485 INFO L87 Difference]: Start difference. First operand 23226 states and 70989 transitions. Second operand 9 states. [2019-12-27 21:00:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:34,795 INFO L93 Difference]: Finished difference Result 70558 states and 213408 transitions. [2019-12-27 21:00:34,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:00:34,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 21:00:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:34,894 INFO L225 Difference]: With dead ends: 70558 [2019-12-27 21:00:34,894 INFO L226 Difference]: Without dead ends: 67847 [2019-12-27 21:00:34,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:00:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67847 states. [2019-12-27 21:00:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67847 to 23322. [2019-12-27 21:00:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-27 21:00:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 71333 transitions. [2019-12-27 21:00:35,642 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 71333 transitions. Word has length 65 [2019-12-27 21:00:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:35,642 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 71333 transitions. [2019-12-27 21:00:35,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:00:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 71333 transitions. [2019-12-27 21:00:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:00:35,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:35,670 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:35,670 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:35,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:35,670 INFO L82 PathProgramCache]: Analyzing trace with hash 659589900, now seen corresponding path program 4 times [2019-12-27 21:00:35,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:35,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284802492] [2019-12-27 21:00:35,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:35,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284802492] [2019-12-27 21:00:35,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:35,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:35,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725085431] [2019-12-27 21:00:35,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:35,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:36,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 356 states and 699 transitions. [2019-12-27 21:00:36,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:36,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:00:36,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:36,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:36,168 INFO L87 Difference]: Start difference. First operand 23322 states and 71333 transitions. Second operand 3 states. [2019-12-27 21:00:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:36,364 INFO L93 Difference]: Finished difference Result 26589 states and 81440 transitions. [2019-12-27 21:00:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:36,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:00:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:36,401 INFO L225 Difference]: With dead ends: 26589 [2019-12-27 21:00:36,401 INFO L226 Difference]: Without dead ends: 26589 [2019-12-27 21:00:36,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26589 states. [2019-12-27 21:00:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26589 to 22041. [2019-12-27 21:00:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22041 states. [2019-12-27 21:00:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22041 states to 22041 states and 68216 transitions. [2019-12-27 21:00:37,162 INFO L78 Accepts]: Start accepts. Automaton has 22041 states and 68216 transitions. Word has length 65 [2019-12-27 21:00:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:37,162 INFO L462 AbstractCegarLoop]: Abstraction has 22041 states and 68216 transitions. [2019-12-27 21:00:37,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22041 states and 68216 transitions. [2019-12-27 21:00:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:00:37,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:37,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:37,195 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:37,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -212190394, now seen corresponding path program 1 times [2019-12-27 21:00:37,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:37,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434868579] [2019-12-27 21:00:37,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:37,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434868579] [2019-12-27 21:00:37,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:37,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:37,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850745342] [2019-12-27 21:00:37,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:37,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:37,529 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 515 transitions. [2019-12-27 21:00:37,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:37,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:00:37,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:00:37,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:00:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:37,534 INFO L87 Difference]: Start difference. First operand 22041 states and 68216 transitions. Second operand 3 states. [2019-12-27 21:00:37,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:37,759 INFO L93 Difference]: Finished difference Result 30320 states and 94017 transitions. [2019-12-27 21:00:37,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:00:37,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:00:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:37,803 INFO L225 Difference]: With dead ends: 30320 [2019-12-27 21:00:37,803 INFO L226 Difference]: Without dead ends: 30320 [2019-12-27 21:00:37,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:00:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30320 states. [2019-12-27 21:00:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30320 to 22586. [2019-12-27 21:00:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22586 states. [2019-12-27 21:00:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22586 states to 22586 states and 69961 transitions. [2019-12-27 21:00:38,224 INFO L78 Accepts]: Start accepts. Automaton has 22586 states and 69961 transitions. Word has length 66 [2019-12-27 21:00:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:38,224 INFO L462 AbstractCegarLoop]: Abstraction has 22586 states and 69961 transitions. [2019-12-27 21:00:38,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:00:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 22586 states and 69961 transitions. [2019-12-27 21:00:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:00:38,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:38,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:38,248 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash -195192520, now seen corresponding path program 2 times [2019-12-27 21:00:38,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:38,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514398171] [2019-12-27 21:00:38,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:38,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514398171] [2019-12-27 21:00:38,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:38,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:00:38,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1863448934] [2019-12-27 21:00:38,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:38,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:39,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 303 states and 609 transitions. [2019-12-27 21:00:39,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:39,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:00:39,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:00:39,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:39,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:00:39,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:00:39,087 INFO L87 Difference]: Start difference. First operand 22586 states and 69961 transitions. Second operand 7 states. [2019-12-27 21:00:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:39,562 INFO L93 Difference]: Finished difference Result 47256 states and 145217 transitions. [2019-12-27 21:00:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:00:39,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 21:00:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:39,624 INFO L225 Difference]: With dead ends: 47256 [2019-12-27 21:00:39,625 INFO L226 Difference]: Without dead ends: 43446 [2019-12-27 21:00:39,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:00:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43446 states. [2019-12-27 21:00:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43446 to 22730. [2019-12-27 21:00:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22730 states. [2019-12-27 21:00:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22730 states to 22730 states and 70519 transitions. [2019-12-27 21:00:40,150 INFO L78 Accepts]: Start accepts. Automaton has 22730 states and 70519 transitions. Word has length 66 [2019-12-27 21:00:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:40,151 INFO L462 AbstractCegarLoop]: Abstraction has 22730 states and 70519 transitions. [2019-12-27 21:00:40,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:00:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 22730 states and 70519 transitions. [2019-12-27 21:00:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:00:40,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:40,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:40,176 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:40,176 INFO L82 PathProgramCache]: Analyzing trace with hash -384910392, now seen corresponding path program 3 times [2019-12-27 21:00:40,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:40,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794976925] [2019-12-27 21:00:40,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:40,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794976925] [2019-12-27 21:00:40,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:40,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:00:40,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [432334328] [2019-12-27 21:00:40,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:40,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:40,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 282 states and 526 transitions. [2019-12-27 21:00:40,553 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:40,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:00:40,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:40,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:40,560 INFO L87 Difference]: Start difference. First operand 22730 states and 70519 transitions. Second operand 4 states. [2019-12-27 21:00:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:40,698 INFO L93 Difference]: Finished difference Result 22532 states and 69731 transitions. [2019-12-27 21:00:40,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:00:40,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:00:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:40,729 INFO L225 Difference]: With dead ends: 22532 [2019-12-27 21:00:40,729 INFO L226 Difference]: Without dead ends: 22532 [2019-12-27 21:00:40,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:00:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2019-12-27 21:00:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 20694. [2019-12-27 21:00:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20694 states. [2019-12-27 21:00:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20694 states to 20694 states and 63965 transitions. [2019-12-27 21:00:41,087 INFO L78 Accepts]: Start accepts. Automaton has 20694 states and 63965 transitions. Word has length 66 [2019-12-27 21:00:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:41,087 INFO L462 AbstractCegarLoop]: Abstraction has 20694 states and 63965 transitions. [2019-12-27 21:00:41,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 20694 states and 63965 transitions. [2019-12-27 21:00:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:00:41,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:41,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:41,110 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -112199822, now seen corresponding path program 1 times [2019-12-27 21:00:41,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:41,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640091570] [2019-12-27 21:00:41,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:41,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640091570] [2019-12-27 21:00:41,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:41,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:00:41,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406959415] [2019-12-27 21:00:41,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:41,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:42,004 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 359 states and 704 transitions. [2019-12-27 21:00:42,005 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:42,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:00:42,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:00:42,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:00:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:00:42,023 INFO L87 Difference]: Start difference. First operand 20694 states and 63965 transitions. Second operand 4 states. [2019-12-27 21:00:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:42,411 INFO L93 Difference]: Finished difference Result 23341 states and 69643 transitions. [2019-12-27 21:00:42,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:00:42,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:00:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:42,457 INFO L225 Difference]: With dead ends: 23341 [2019-12-27 21:00:42,457 INFO L226 Difference]: Without dead ends: 23341 [2019-12-27 21:00:42,457 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-27 21:00:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23341 states. [2019-12-27 21:00:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23341 to 15439. [2019-12-27 21:00:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15439 states. [2019-12-27 21:00:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15439 states to 15439 states and 46585 transitions. [2019-12-27 21:00:42,838 INFO L78 Accepts]: Start accepts. Automaton has 15439 states and 46585 transitions. Word has length 66 [2019-12-27 21:00:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:42,839 INFO L462 AbstractCegarLoop]: Abstraction has 15439 states and 46585 transitions. [2019-12-27 21:00:42,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:00:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 15439 states and 46585 transitions. [2019-12-27 21:00:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:00:42,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:42,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:42,854 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1013027499, now seen corresponding path program 1 times [2019-12-27 21:00:42,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:42,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097066562] [2019-12-27 21:00:42,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:43,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097066562] [2019-12-27 21:00:43,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:43,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:00:43,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467096736] [2019-12-27 21:00:43,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:43,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:43,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 524 transitions. [2019-12-27 21:00:43,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:43,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:00:43,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:00:43,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:00:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:00:43,298 INFO L87 Difference]: Start difference. First operand 15439 states and 46585 transitions. Second operand 10 states. [2019-12-27 21:00:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:44,632 INFO L93 Difference]: Finished difference Result 23020 states and 69118 transitions. [2019-12-27 21:00:44,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:00:44,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 21:00:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:44,659 INFO L225 Difference]: With dead ends: 23020 [2019-12-27 21:00:44,659 INFO L226 Difference]: Without dead ends: 18939 [2019-12-27 21:00:44,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:00:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18939 states. [2019-12-27 21:00:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18939 to 15789. [2019-12-27 21:00:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15789 states. [2019-12-27 21:00:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15789 states to 15789 states and 47542 transitions. [2019-12-27 21:00:44,935 INFO L78 Accepts]: Start accepts. Automaton has 15789 states and 47542 transitions. Word has length 67 [2019-12-27 21:00:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:44,936 INFO L462 AbstractCegarLoop]: Abstraction has 15789 states and 47542 transitions. [2019-12-27 21:00:44,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:00:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15789 states and 47542 transitions. [2019-12-27 21:00:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:00:44,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:44,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:44,952 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash 608064189, now seen corresponding path program 2 times [2019-12-27 21:00:44,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:44,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559516474] [2019-12-27 21:00:44,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:45,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:45,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559516474] [2019-12-27 21:00:45,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:45,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:00:45,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741162611] [2019-12-27 21:00:45,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:45,134 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:45,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 313 states and 634 transitions. [2019-12-27 21:00:45,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:00:45,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:00:45,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:00:45,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:00:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:00:45,903 INFO L87 Difference]: Start difference. First operand 15789 states and 47542 transitions. Second operand 12 states. [2019-12-27 21:00:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:47,402 INFO L93 Difference]: Finished difference Result 23119 states and 68779 transitions. [2019-12-27 21:00:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:00:47,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 21:00:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:47,429 INFO L225 Difference]: With dead ends: 23119 [2019-12-27 21:00:47,430 INFO L226 Difference]: Without dead ends: 19934 [2019-12-27 21:00:47,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:00:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19934 states. [2019-12-27 21:00:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19934 to 15869. [2019-12-27 21:00:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15869 states. [2019-12-27 21:00:47,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15869 states to 15869 states and 47607 transitions. [2019-12-27 21:00:47,718 INFO L78 Accepts]: Start accepts. Automaton has 15869 states and 47607 transitions. Word has length 67 [2019-12-27 21:00:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:47,718 INFO L462 AbstractCegarLoop]: Abstraction has 15869 states and 47607 transitions. [2019-12-27 21:00:47,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:00:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15869 states and 47607 transitions. [2019-12-27 21:00:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:00:47,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:47,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:47,737 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1394809923, now seen corresponding path program 3 times [2019-12-27 21:00:47,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:47,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225995382] [2019-12-27 21:00:47,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:00:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:00:47,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225995382] [2019-12-27 21:00:47,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:00:47,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:00:47,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798257516] [2019-12-27 21:00:47,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:00:47,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:00:48,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 283 states and 556 transitions. [2019-12-27 21:00:48,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:00:48,345 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:00:48,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:00:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:00:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:00:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:00:48,346 INFO L87 Difference]: Start difference. First operand 15869 states and 47607 transitions. Second operand 11 states. [2019-12-27 21:00:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:00:49,791 INFO L93 Difference]: Finished difference Result 33697 states and 99778 transitions. [2019-12-27 21:00:49,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 21:00:49,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 21:00:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:00:49,826 INFO L225 Difference]: With dead ends: 33697 [2019-12-27 21:00:49,826 INFO L226 Difference]: Without dead ends: 26652 [2019-12-27 21:00:49,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 21:00:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26652 states. [2019-12-27 21:00:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26652 to 14903. [2019-12-27 21:00:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14903 states. [2019-12-27 21:00:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14903 states to 14903 states and 44619 transitions. [2019-12-27 21:00:50,150 INFO L78 Accepts]: Start accepts. Automaton has 14903 states and 44619 transitions. Word has length 67 [2019-12-27 21:00:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:00:50,150 INFO L462 AbstractCegarLoop]: Abstraction has 14903 states and 44619 transitions. [2019-12-27 21:00:50,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:00:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 14903 states and 44619 transitions. [2019-12-27 21:00:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:00:50,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:00:50,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:00:50,166 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:00:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:00:50,167 INFO L82 PathProgramCache]: Analyzing trace with hash -614399051, now seen corresponding path program 4 times [2019-12-27 21:00:50,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:00:50,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14200866] [2019-12-27 21:00:50,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:00:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:00:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:00:50,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:00:50,292 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:00:50,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~a$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t919~0.base_26|) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~a$r_buff1_thd3~0_48) (= |v_ULTIMATE.start_main_~#t919~0.offset_19| 0) (= v_~__unbuffered_p2_EBX~0_16 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z~0_7) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff1~0_23) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t919~0.base_26| 4)) (= 0 v_~a$w_buff0_used~0_113) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_26| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_26|) |v_ULTIMATE.start_main_~#t919~0.offset_19| 0))) (= v_~a$flush_delayed~0_13 0) (= 0 v_~a$r_buff1_thd1~0_18) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~a$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= v_~a$r_buff0_thd2~0_21 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~a$w_buff0~0_26) (= (store .cse0 |v_ULTIMATE.start_main_~#t919~0.base_26| 1) |v_#valid_64|) (= v_~a$r_buff0_thd3~0_79 0) (= 0 v_~a$w_buff1_used~0_68) (= (select .cse0 |v_ULTIMATE.start_main_~#t919~0.base_26|) 0) (= 0 v_~a$r_buff1_thd2~0_18) (= v_~a~0_27 0) (= v_~a$r_buff0_thd0~0_21 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_~#t919~0.offset=|v_ULTIMATE.start_main_~#t919~0.offset_19|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_21|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t919~0.base=|v_ULTIMATE.start_main_~#t919~0.base_26|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_16|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_17|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~a$w_buff1~0=v_~a$w_buff1~0_23, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_7, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t919~0.offset, ULTIMATE.start_main_~#t921~0.offset, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t920~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t919~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t920~0.offset, ULTIMATE.start_main_~#t921~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 21:00:50,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= ~a$r_buff0_thd1~0_In-1697733187 ~a$r_buff1_thd1~0_Out-1697733187) (= ~a$r_buff0_thd0~0_In-1697733187 ~a$r_buff1_thd0~0_Out-1697733187) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1697733187 0)) (= ~a$r_buff0_thd1~0_Out-1697733187 1) (= ~a$r_buff1_thd3~0_Out-1697733187 ~a$r_buff0_thd3~0_In-1697733187) (= ~a$r_buff1_thd2~0_Out-1697733187 ~a$r_buff0_thd2~0_In-1697733187) (= ~x~0_In-1697733187 ~__unbuffered_p0_EAX~0_Out-1697733187)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1697733187, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1697733187, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1697733187, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1697733187, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1697733187, ~x~0=~x~0_In-1697733187} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1697733187, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1697733187, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1697733187, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1697733187, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1697733187, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1697733187, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1697733187, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1697733187, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1697733187, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1697733187, ~x~0=~x~0_In-1697733187} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:00:50,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t920~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t920~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t920~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11|) |v_ULTIMATE.start_main_~#t920~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t920~0.offset_10|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t920~0.base, #length, ULTIMATE.start_main_~#t920~0.offset] because there is no mapped edge [2019-12-27 21:00:50,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In1416241349 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In1416241349 256)))) (or (and (= ~a~0_In1416241349 |P1Thread1of1ForFork2_#t~ite9_Out1416241349|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In1416241349 |P1Thread1of1ForFork2_#t~ite9_Out1416241349|)))) InVars {~a~0=~a~0_In1416241349, ~a$w_buff1~0=~a$w_buff1~0_In1416241349, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1416241349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1416241349} OutVars{~a~0=~a~0_In1416241349, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1416241349|, ~a$w_buff1~0=~a$w_buff1~0_In1416241349, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1416241349, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1416241349} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 21:00:50,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= v_~a~0_22 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_22, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 21:00:50,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In1835512072 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1835512072 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1835512072| ~a$w_buff0_used~0_In1835512072)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1835512072|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1835512072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835512072} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1835512072, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1835512072, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1835512072|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:00:50,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-607041446 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-607041446 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-607041446 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-607041446 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-607041446| ~a$w_buff1_used~0_In-607041446) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-607041446| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-607041446, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-607041446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-607041446, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-607041446} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-607041446, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-607041446, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-607041446, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-607041446|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-607041446} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:00:50,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1364343136 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1364343136 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-1364343136| ~a$r_buff0_thd2~0_In-1364343136)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1364343136| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1364343136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1364343136} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1364343136, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1364343136, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1364343136|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:00:50,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-491581007 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-491581007 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-491581007 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-491581007 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-491581007| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-491581007| ~a$r_buff1_thd2~0_In-491581007) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-491581007, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-491581007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-491581007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-491581007} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-491581007, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-491581007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-491581007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-491581007, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-491581007|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:00:50,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:00:50,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In91207700 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In91207700 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In91207700 |P0Thread1of1ForFork1_#t~ite5_Out91207700|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out91207700|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In91207700, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In91207700} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out91207700|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In91207700, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In91207700} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:00:50,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-423132674 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-423132674 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-423132674 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-423132674 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-423132674| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-423132674| ~a$w_buff1_used~0_In-423132674)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-423132674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-423132674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-423132674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-423132674} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-423132674|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-423132674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-423132674, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-423132674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-423132674} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:00:50,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-653910738 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-653910738 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_Out-653910738 ~a$r_buff0_thd1~0_In-653910738)) (and (not .cse1) (not .cse0) (= ~a$r_buff0_thd1~0_Out-653910738 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-653910738, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-653910738} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-653910738|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-653910738, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-653910738} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:00:50,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In587232743 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In587232743 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In587232743 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In587232743 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd1~0_In587232743 |P0Thread1of1ForFork1_#t~ite8_Out587232743|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out587232743|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In587232743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In587232743, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In587232743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In587232743} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out587232743|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In587232743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In587232743, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In587232743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In587232743} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:00:50,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L754-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~a$r_buff1_thd1~0_13 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_13, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:00:50,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L834-1-->L836: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t921~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t921~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t921~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11|) |v_ULTIMATE.start_main_~#t921~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t921~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t921~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t921~0.offset] because there is no mapped edge [2019-12-27 21:00:50,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In374405860 256)))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In374405860 256) 0))) (or (= (mod ~a$w_buff0_used~0_In374405860 256) 0) (and .cse0 (= (mod ~a$r_buff1_thd3~0_In374405860 256) 0)) (and .cse0 (= 0 (mod ~a$w_buff1_used~0_In374405860 256))))) .cse1 (= ~a$w_buff1_used~0_In374405860 |P2Thread1of1ForFork0_#t~ite29_Out374405860|) (= |P2Thread1of1ForFork0_#t~ite30_Out374405860| |P2Thread1of1ForFork0_#t~ite29_Out374405860|)) (and (not .cse1) (= ~a$w_buff1_used~0_In374405860 |P2Thread1of1ForFork0_#t~ite30_Out374405860|) (= |P2Thread1of1ForFork0_#t~ite29_In374405860| |P2Thread1of1ForFork0_#t~ite29_Out374405860|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In374405860, ~a$w_buff0_used~0=~a$w_buff0_used~0_In374405860, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In374405860, ~a$w_buff1_used~0=~a$w_buff1_used~0_In374405860, ~weak$$choice2~0=~weak$$choice2~0_In374405860, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In374405860|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In374405860, ~a$w_buff0_used~0=~a$w_buff0_used~0_In374405860, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In374405860, ~a$w_buff1_used~0=~a$w_buff1_used~0_In374405860, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out374405860|, ~weak$$choice2~0=~weak$$choice2~0_In374405860, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out374405860|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 21:00:50,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (= v_~a$r_buff0_thd3~0_52 v_~a$r_buff0_thd3~0_51) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:00:50,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_20 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 21:00:50,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In2093877464 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2093877464 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2093877464| ~a~0_In2093877464)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2093877464| ~a$w_buff1~0_In2093877464) (not .cse0)))) InVars {~a~0=~a~0_In2093877464, ~a$w_buff1~0=~a$w_buff1~0_In2093877464, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2093877464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2093877464} OutVars{~a~0=~a~0_In2093877464, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2093877464|, ~a$w_buff1~0=~a$w_buff1~0_In2093877464, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2093877464, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2093877464} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:00:50,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_18 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_18, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:00:50,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1426899968 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1426899968 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1426899968 |P2Thread1of1ForFork0_#t~ite40_Out1426899968|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1426899968| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1426899968, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1426899968} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1426899968|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1426899968, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1426899968} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:00:50,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-647582894 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-647582894 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-647582894 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-647582894 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-647582894| ~a$w_buff1_used~0_In-647582894)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out-647582894| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-647582894, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-647582894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-647582894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-647582894} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-647582894, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-647582894, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-647582894, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-647582894, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-647582894|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:00:50,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-555665656 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-555665656 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-555665656|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd3~0_In-555665656 |P2Thread1of1ForFork0_#t~ite42_Out-555665656|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-555665656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-555665656} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-555665656, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-555665656, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-555665656|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:00:50,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-931748012 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-931748012 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-931748012 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-931748012 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-931748012|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-931748012 |P2Thread1of1ForFork0_#t~ite43_Out-931748012|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-931748012, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-931748012, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-931748012, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-931748012} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-931748012|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-931748012, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-931748012, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-931748012, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-931748012} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:00:50,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:00:50,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:00:50,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1138177848| |ULTIMATE.start_main_#t~ite48_Out1138177848|)) (.cse0 (= (mod ~a$w_buff1_used~0_In1138177848 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In1138177848 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1138177848| ~a$w_buff1~0_In1138177848) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out1138177848| ~a~0_In1138177848) .cse1 (or .cse0 .cse2)))) InVars {~a~0=~a~0_In1138177848, ~a$w_buff1~0=~a$w_buff1~0_In1138177848, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1138177848, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1138177848} OutVars{~a~0=~a~0_In1138177848, ~a$w_buff1~0=~a$w_buff1~0_In1138177848, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1138177848|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1138177848, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1138177848|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1138177848} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:00:50,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1874283540 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1874283540 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1874283540 |ULTIMATE.start_main_#t~ite49_Out-1874283540|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1874283540|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874283540, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1874283540} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1874283540, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1874283540|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1874283540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:00:50,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In602115030 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In602115030 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In602115030 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In602115030 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In602115030 |ULTIMATE.start_main_#t~ite50_Out602115030|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite50_Out602115030|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In602115030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602115030, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In602115030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602115030} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out602115030|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In602115030, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602115030, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In602115030, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602115030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:00:50,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In1451567527 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1451567527 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In1451567527 |ULTIMATE.start_main_#t~ite51_Out1451567527|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1451567527|) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1451567527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1451567527} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1451567527|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1451567527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1451567527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:00:50,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1968870246 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In1968870246 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1968870246 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1968870246 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1968870246| ~a$r_buff1_thd0~0_In1968870246) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out1968870246| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1968870246, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1968870246, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1968870246, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1968870246} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1968870246|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1968870246, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1968870246, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1968870246, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1968870246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:00:50,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite52_13| v_~a$r_buff1_thd0~0_19) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:00:50,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:00:50 BasicIcfg [2019-12-27 21:00:50,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:00:50,412 INFO L168 Benchmark]: Toolchain (without parser) took 110157.71 ms. Allocated memory was 146.3 MB in the beginning and 4.5 GB in the end (delta: 4.4 GB). Free memory was 102.1 MB in the beginning and 913.5 MB in the end (delta: -811.4 MB). Peak memory consumption was 3.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,412 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 146.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.68 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 157.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.49 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,414 INFO L168 Benchmark]: Boogie Preprocessor took 40.92 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,415 INFO L168 Benchmark]: RCFGBuilder took 912.41 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,415 INFO L168 Benchmark]: TraceAbstraction took 108375.22 ms. Allocated memory was 204.5 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 102.1 MB in the beginning and 913.5 MB in the end (delta: -811.4 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-12-27 21:00:50,418 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.28 ms. Allocated memory is still 146.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.68 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 157.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.49 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.92 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 912.41 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108375.22 ms. Allocated memory was 204.5 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 102.1 MB in the beginning and 913.5 MB in the end (delta: -811.4 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7337 VarBasedMoverChecksPositive, 224 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86659 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t919, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t920, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t921, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.0s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6454 SDtfs, 6194 SDslu, 19571 SDs, 0 SdLazy, 9288 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 101 SyntacticMatches, 48 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163842occurred 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.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 254858 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 172310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...