/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:37:58,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:37:58,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:37:58,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:37:58,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:37:58,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:37:58,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:37:58,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:37:58,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:37:58,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:37:58,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:37:58,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:37:58,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:37:58,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:37:58,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:37:58,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:37:58,880 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:37:58,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:37:58,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:37:58,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:37:58,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:37:58,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:37:58,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:37:58,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:37:58,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:37:58,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:37:58,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:37:58,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:37:58,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:37:58,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:37:58,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:37:58,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:37:58,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:37:58,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:37:58,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:37:58,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:37:58,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:37:58,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:37:58,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:37:58,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:37:58,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:37:58,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:37:58,947 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:37:58,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:37:58,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:37:58,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:37:58,952 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:37:58,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:37:58,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:37:58,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:37:58,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:37:58,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:37:58,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:37:58,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:37:58,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:37:58,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:37:58,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:37:58,954 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:37:58,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:37:58,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:37:58,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:37:58,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:37:58,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:37:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:37:58,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:37:58,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:37:58,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:37:58,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:37:58,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:37:58,957 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:37:58,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:37:58,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:37:59,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:37:59,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:37:59,267 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:37:59,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:37:59,269 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:37:59,270 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i [2019-12-18 21:37:59,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029c61158/ee7458a46f0a4fdfa9eb65bdf71a7f9a/FLAGeba1a084a [2019-12-18 21:37:59,857 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:37:59,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_rmo.opt.i [2019-12-18 21:37:59,875 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029c61158/ee7458a46f0a4fdfa9eb65bdf71a7f9a/FLAGeba1a084a [2019-12-18 21:38:00,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/029c61158/ee7458a46f0a4fdfa9eb65bdf71a7f9a [2019-12-18 21:38:00,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:38:00,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:38:00,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:38:00,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:38:00,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:38:00,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:00" (1/1) ... [2019-12-18 21:38:00,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:00, skipping insertion in model container [2019-12-18 21:38:00,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:00" (1/1) ... [2019-12-18 21:38:00,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:38:00,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:38:00,858 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:38:00,880 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:38:00,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:38:01,062 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:38:01,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01 WrapperNode [2019-12-18 21:38:01,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:38:01,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:38:01,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:38:01,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:38:01,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:38:01,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:38:01,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:38:01,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:38:01,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (1/1) ... [2019-12-18 21:38:01,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:38:01,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:38:01,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:38:01,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:38:01,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38: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-18 21:38:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:38:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:38:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:38:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:38:01,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:38:01,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:38:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:38:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:38:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:38:01,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:38:01,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:38:01,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:38:01,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:38:01,267 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:38:02,098 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:38:02,099 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:38:02,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:02 BoogieIcfgContainer [2019-12-18 21:38:02,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:38:02,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:38:02,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:38:02,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:38:02,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:38:00" (1/3) ... [2019-12-18 21:38:02,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c095e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:02, skipping insertion in model container [2019-12-18 21:38:02,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:01" (2/3) ... [2019-12-18 21:38:02,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c095e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:02, skipping insertion in model container [2019-12-18 21:38:02,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:02" (3/3) ... [2019-12-18 21:38:02,110 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.opt.i [2019-12-18 21:38:02,121 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:38:02,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:38:02,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:38:02,130 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:38:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,180 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,210 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,218 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,219 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,246 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,248 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,256 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:38:02,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:38:02,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:38:02,302 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:38:02,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:38:02,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:38:02,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:38:02,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:38:02,303 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:38:02,303 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:38:02,321 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 21:38:02,322 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:38:02,408 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:38:02,408 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:38:02,428 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:38:02,456 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:38:02,505 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:38:02,506 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:38:02,514 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:38:02,535 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:38:02,536 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:38:05,871 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:38:06,031 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:38:06,062 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-18 21:38:06,062 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 21:38:06,065 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-18 21:38:29,566 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-18 21:38:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-18 21:38:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:38:29,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:29,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:38:29,575 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:38:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-18 21:38:29,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:29,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224390143] [2019-12-18 21:38:29,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:38:29,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224390143] [2019-12-18 21:38:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:38:29,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998605768] [2019-12-18 21:38:29,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:38:29,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:29,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:38:29,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:38:29,809 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-18 21:38:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:31,267 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-18 21:38:31,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:38:31,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:38:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:31,903 INFO L225 Difference]: With dead ends: 120110 [2019-12-18 21:38:31,903 INFO L226 Difference]: Without dead ends: 112648 [2019-12-18 21:38:31,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:38:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-18 21:38:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-18 21:38:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-18 21:38:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-18 21:38:43,049 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-18 21:38:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:38:43,049 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-18 21:38:43,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:38:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-18 21:38:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:38:43,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:38:43,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:38:43,054 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:38:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:38:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-18 21:38:43,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:38:43,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866291749] [2019-12-18 21:38:43,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:38:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:38:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:38:43,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866291749] [2019-12-18 21:38:43,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:38:43,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:38:43,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889468406] [2019-12-18 21:38:43,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:38:43,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:38:43,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:38:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:38:43,163 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-18 21:38:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:38:49,033 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-18 21:38:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:38:49,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:38:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:38:49,727 INFO L225 Difference]: With dead ends: 175220 [2019-12-18 21:38:49,727 INFO L226 Difference]: Without dead ends: 175171 [2019-12-18 21:38:49,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:38:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-18 21:39:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-18 21:39:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-18 21:39:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-18 21:39:03,659 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-18 21:39:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:03,660 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-18 21:39:03,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:39:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-18 21:39:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:39:03,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:03,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:03,668 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:03,668 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-18 21:39:03,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:03,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670069198] [2019-12-18 21:39:03,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670069198] [2019-12-18 21:39:03,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:03,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:03,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295235161] [2019-12-18 21:39:03,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:03,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:03,742 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-18 21:39:03,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:03,883 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-18 21:39:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:03,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:39:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:03,947 INFO L225 Difference]: With dead ends: 34935 [2019-12-18 21:39:03,948 INFO L226 Difference]: Without dead ends: 34935 [2019-12-18 21:39:03,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-18 21:39:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-18 21:39:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-18 21:39:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-18 21:39:04,598 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-18 21:39:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:04,598 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-18 21:39:04,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-18 21:39:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:39:04,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:04,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:04,602 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-18 21:39:04,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:04,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298010048] [2019-12-18 21:39:04,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:04,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298010048] [2019-12-18 21:39:04,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:04,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:04,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634113632] [2019-12-18 21:39:04,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:04,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:04,673 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-18 21:39:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:04,917 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-18 21:39:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:04,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:39:04,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:05,011 INFO L225 Difference]: With dead ends: 52469 [2019-12-18 21:39:05,011 INFO L226 Difference]: Without dead ends: 52469 [2019-12-18 21:39:05,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-18 21:39:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-18 21:39:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-18 21:39:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-18 21:39:08,649 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-18 21:39:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:08,650 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-18 21:39:08,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:08,651 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-18 21:39:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:39:08,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:08,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:08,654 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-18 21:39:08,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:08,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152754517] [2019-12-18 21:39:08,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:08,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152754517] [2019-12-18 21:39:08,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:08,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:08,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629244467] [2019-12-18 21:39:08,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:39:08,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:39:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:08,740 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-18 21:39:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:09,239 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-18 21:39:09,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:39:09,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:39:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:09,328 INFO L225 Difference]: With dead ends: 54128 [2019-12-18 21:39:09,328 INFO L226 Difference]: Without dead ends: 54128 [2019-12-18 21:39:09,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-18 21:39:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-18 21:39:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-18 21:39:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-18 21:39:10,167 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-18 21:39:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:10,167 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-18 21:39:10,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:39:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-18 21:39:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:39:10,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:10,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:10,181 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-18 21:39:10,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:10,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401464181] [2019-12-18 21:39:10,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:10,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401464181] [2019-12-18 21:39:10,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:10,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:39:10,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590529750] [2019-12-18 21:39:10,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:39:10,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:10,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:39:10,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:39:10,273 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-18 21:39:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:11,649 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-18 21:39:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:39:11,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:39:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:11,759 INFO L225 Difference]: With dead ends: 67629 [2019-12-18 21:39:11,759 INFO L226 Difference]: Without dead ends: 67622 [2019-12-18 21:39:11,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:39:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-18 21:39:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-18 21:39:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-18 21:39:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-18 21:39:12,690 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-18 21:39:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:12,691 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-18 21:39:12,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:39:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-18 21:39:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:39:12,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:12,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:12,709 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:12,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-18 21:39:12,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:12,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649487] [2019-12-18 21:39:12,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:12,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649487] [2019-12-18 21:39:12,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:12,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:12,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269235180] [2019-12-18 21:39:12,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:39:12,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:12,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:39:12,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:12,791 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-18 21:39:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:12,875 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-18 21:39:12,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:39:12,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:39:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:12,904 INFO L225 Difference]: With dead ends: 18428 [2019-12-18 21:39:12,904 INFO L226 Difference]: Without dead ends: 18428 [2019-12-18 21:39:12,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-18 21:39:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-18 21:39:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-18 21:39:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-18 21:39:13,194 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-18 21:39:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:13,195 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-18 21:39:13,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:39:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-18 21:39:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:39:13,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:13,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:13,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-18 21:39:13,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:13,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526141919] [2019-12-18 21:39:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:13,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526141919] [2019-12-18 21:39:13,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:13,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:39:13,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90662704] [2019-12-18 21:39:13,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:39:13,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:39:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:39:13,340 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-18 21:39:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:13,914 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-18 21:39:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:39:13,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:39:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:13,951 INFO L225 Difference]: With dead ends: 25507 [2019-12-18 21:39:13,951 INFO L226 Difference]: Without dead ends: 25507 [2019-12-18 21:39:13,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:39:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-18 21:39:14,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-18 21:39:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-18 21:39:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-18 21:39:14,621 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-18 21:39:14,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:14,621 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-18 21:39:14,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:39:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-18 21:39:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:39:14,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:14,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:14,645 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-18 21:39:14,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:14,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228672379] [2019-12-18 21:39:14,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:14,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228672379] [2019-12-18 21:39:14,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:14,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:39:14,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015244941] [2019-12-18 21:39:14,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:39:14,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:39:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:14,736 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-18 21:39:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:15,998 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-18 21:39:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:39:15,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:39:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:16,038 INFO L225 Difference]: With dead ends: 28486 [2019-12-18 21:39:16,038 INFO L226 Difference]: Without dead ends: 28486 [2019-12-18 21:39:16,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:39:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-18 21:39:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-18 21:39:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-18 21:39:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-18 21:39:16,396 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-18 21:39:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:16,397 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-18 21:39:16,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:39:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-18 21:39:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:39:16,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:16,423 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-18 21:39:16,423 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:16,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:16,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-18 21:39:16,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:16,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071226929] [2019-12-18 21:39:16,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:16,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071226929] [2019-12-18 21:39:16,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:16,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:39:16,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511820653] [2019-12-18 21:39:16,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:39:16,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:39:16,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:16,501 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-18 21:39:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:17,190 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-18 21:39:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:39:17,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:39:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:17,244 INFO L225 Difference]: With dead ends: 28283 [2019-12-18 21:39:17,244 INFO L226 Difference]: Without dead ends: 28283 [2019-12-18 21:39:17,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:39:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-18 21:39:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-18 21:39:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-18 21:39:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-18 21:39:17,722 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-18 21:39:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:17,722 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-18 21:39:17,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:39:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-18 21:39:17,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:39:17,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:17,756 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-18 21:39:17,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-18 21:39:17,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:17,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542555499] [2019-12-18 21:39:17,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:17,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542555499] [2019-12-18 21:39:17,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:17,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:39:17,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472971418] [2019-12-18 21:39:17,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:39:17,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:17,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:39:17,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:17,818 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 5 states. [2019-12-18 21:39:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:17,935 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-18 21:39:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:39:17,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:39:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:17,980 INFO L225 Difference]: With dead ends: 24998 [2019-12-18 21:39:17,981 INFO L226 Difference]: Without dead ends: 24998 [2019-12-18 21:39:17,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-18 21:39:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-18 21:39:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-18 21:39:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-18 21:39:18,343 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-18 21:39:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:18,344 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-18 21:39:18,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:39:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-18 21:39:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:39:18,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:18,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:18,368 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-18 21:39:18,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:18,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895121116] [2019-12-18 21:39:18,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:18,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895121116] [2019-12-18 21:39:18,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:18,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:39:18,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710104802] [2019-12-18 21:39:18,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:39:18,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:39:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:18,474 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 7 states. [2019-12-18 21:39:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:19,085 INFO L93 Difference]: Finished difference Result 67799 states and 211747 transitions. [2019-12-18 21:39:19,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:39:19,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:39:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:19,159 INFO L225 Difference]: With dead ends: 67799 [2019-12-18 21:39:19,159 INFO L226 Difference]: Without dead ends: 51948 [2019-12-18 21:39:19,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:39:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51948 states. [2019-12-18 21:39:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51948 to 27688. [2019-12-18 21:39:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-18 21:39:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-18 21:39:19,793 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-18 21:39:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:19,793 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-18 21:39:19,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:39:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-18 21:39:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:39:19,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:19,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:19,836 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-18 21:39:19,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:19,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822083129] [2019-12-18 21:39:19,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:19,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822083129] [2019-12-18 21:39:19,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:19,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:39:19,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587441519] [2019-12-18 21:39:19,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:39:19,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:39:19,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:19,939 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 7 states. [2019-12-18 21:39:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:20,585 INFO L93 Difference]: Finished difference Result 76922 states and 238949 transitions. [2019-12-18 21:39:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:39:20,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:39:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:20,677 INFO L225 Difference]: With dead ends: 76922 [2019-12-18 21:39:20,678 INFO L226 Difference]: Without dead ends: 54229 [2019-12-18 21:39:20,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:39:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54229 states. [2019-12-18 21:39:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54229 to 32348. [2019-12-18 21:39:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-18 21:39:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-18 21:39:21,411 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-18 21:39:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:21,411 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-18 21:39:21,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:39:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-18 21:39:21,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:39:21,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:21,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:21,449 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-18 21:39:21,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:21,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185066596] [2019-12-18 21:39:21,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:21,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185066596] [2019-12-18 21:39:21,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:21,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:39:21,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776069373] [2019-12-18 21:39:21,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:39:21,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:39:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:21,553 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 7 states. [2019-12-18 21:39:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:22,401 INFO L93 Difference]: Finished difference Result 65367 states and 203736 transitions. [2019-12-18 21:39:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:39:22,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:39:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:22,527 INFO L225 Difference]: With dead ends: 65367 [2019-12-18 21:39:22,527 INFO L226 Difference]: Without dead ends: 58008 [2019-12-18 21:39:22,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:39:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58008 states. [2019-12-18 21:39:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58008 to 32656. [2019-12-18 21:39:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-18 21:39:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-18 21:39:23,285 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-18 21:39:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:23,285 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-18 21:39:23,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:39:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-18 21:39:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:39:23,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:23,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:23,323 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:23,323 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-18 21:39:23,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:23,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676841671] [2019-12-18 21:39:23,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:23,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676841671] [2019-12-18 21:39:23,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:23,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:23,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683951400] [2019-12-18 21:39:23,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:23,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:23,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:23,391 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-18 21:39:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:23,647 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-18 21:39:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:23,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:39:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:23,750 INFO L225 Difference]: With dead ends: 39410 [2019-12-18 21:39:23,750 INFO L226 Difference]: Without dead ends: 39410 [2019-12-18 21:39:23,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-18 21:39:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-18 21:39:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-18 21:39:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-18 21:39:24,480 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-18 21:39:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:24,481 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-18 21:39:24,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-18 21:39:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:24,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:24,521 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:24,521 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-18 21:39:24,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:24,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455427902] [2019-12-18 21:39:24,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:24,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455427902] [2019-12-18 21:39:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:24,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:39:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76608993] [2019-12-18 21:39:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:39:24,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:39:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:24,581 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 4 states. [2019-12-18 21:39:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:24,993 INFO L93 Difference]: Finished difference Result 53912 states and 170313 transitions. [2019-12-18 21:39:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:39:24,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:39:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:25,087 INFO L225 Difference]: With dead ends: 53912 [2019-12-18 21:39:25,088 INFO L226 Difference]: Without dead ends: 53912 [2019-12-18 21:39:25,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53912 states. [2019-12-18 21:39:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53912 to 37800. [2019-12-18 21:39:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37800 states. [2019-12-18 21:39:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 120622 transitions. [2019-12-18 21:39:26,136 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 120622 transitions. Word has length 65 [2019-12-18 21:39:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:26,136 INFO L462 AbstractCegarLoop]: Abstraction has 37800 states and 120622 transitions. [2019-12-18 21:39:26,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:39:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 120622 transitions. [2019-12-18 21:39:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:26,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:26,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:26,190 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-18 21:39:26,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:26,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380326173] [2019-12-18 21:39:26,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:26,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380326173] [2019-12-18 21:39:26,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:26,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:26,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532927976] [2019-12-18 21:39:26,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:26,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:26,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:26,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:26,248 INFO L87 Difference]: Start difference. First operand 37800 states and 120622 transitions. Second operand 3 states. [2019-12-18 21:39:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:26,567 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-18 21:39:26,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:26,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:39:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:26,647 INFO L225 Difference]: With dead ends: 53096 [2019-12-18 21:39:26,647 INFO L226 Difference]: Without dead ends: 53096 [2019-12-18 21:39:26,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-18 21:39:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-18 21:39:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-18 21:39:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-18 21:39:27,317 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-18 21:39:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:27,317 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-18 21:39:27,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-18 21:39:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:27,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:27,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:27,361 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1218113347, now seen corresponding path program 3 times [2019-12-18 21:39:27,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:27,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468120612] [2019-12-18 21:39:27,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:27,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-18 21:39:27,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468120612] [2019-12-18 21:39:27,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:27,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:39:27,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722766857] [2019-12-18 21:39:27,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:39:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:39:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:27,418 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 4 states. [2019-12-18 21:39:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:27,715 INFO L93 Difference]: Finished difference Result 47614 states and 149860 transitions. [2019-12-18 21:39:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:39:27,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:39:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:27,784 INFO L225 Difference]: With dead ends: 47614 [2019-12-18 21:39:27,784 INFO L226 Difference]: Without dead ends: 47614 [2019-12-18 21:39:27,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47614 states. [2019-12-18 21:39:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 38055. [2019-12-18 21:39:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-18 21:39:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 121477 transitions. [2019-12-18 21:39:28,754 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 121477 transitions. Word has length 65 [2019-12-18 21:39:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:28,754 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 121477 transitions. [2019-12-18 21:39:28,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:39:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 121477 transitions. [2019-12-18 21:39:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:28,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:28,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:28,801 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 4 times [2019-12-18 21:39:28,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:28,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715881028] [2019-12-18 21:39:28,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:28,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-18 21:39:28,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715881028] [2019-12-18 21:39:28,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:28,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:39:28,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119502951] [2019-12-18 21:39:28,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:39:28,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:39:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:28,894 INFO L87 Difference]: Start difference. First operand 38055 states and 121477 transitions. Second operand 7 states. [2019-12-18 21:39:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:29,697 INFO L93 Difference]: Finished difference Result 80005 states and 251266 transitions. [2019-12-18 21:39:29,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:39:29,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:39:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:29,841 INFO L225 Difference]: With dead ends: 80005 [2019-12-18 21:39:29,841 INFO L226 Difference]: Without dead ends: 73765 [2019-12-18 21:39:29,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:39:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73765 states. [2019-12-18 21:39:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73765 to 38119. [2019-12-18 21:39:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38119 states. [2019-12-18 21:39:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38119 states to 38119 states and 121695 transitions. [2019-12-18 21:39:30,754 INFO L78 Accepts]: Start accepts. Automaton has 38119 states and 121695 transitions. Word has length 65 [2019-12-18 21:39:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:30,755 INFO L462 AbstractCegarLoop]: Abstraction has 38119 states and 121695 transitions. [2019-12-18 21:39:30,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:39:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 38119 states and 121695 transitions. [2019-12-18 21:39:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:30,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:30,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:30,802 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:30,802 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 5 times [2019-12-18 21:39:30,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:30,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159394793] [2019-12-18 21:39:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:30,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159394793] [2019-12-18 21:39:30,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:30,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:39:30,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158604742] [2019-12-18 21:39:30,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:39:30,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:39:30,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:39:30,903 INFO L87 Difference]: Start difference. First operand 38119 states and 121695 transitions. Second operand 7 states. [2019-12-18 21:39:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:31,768 INFO L93 Difference]: Finished difference Result 60800 states and 193788 transitions. [2019-12-18 21:39:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:39:31,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:39:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:31,868 INFO L225 Difference]: With dead ends: 60800 [2019-12-18 21:39:31,868 INFO L226 Difference]: Without dead ends: 60800 [2019-12-18 21:39:31,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60800 states. [2019-12-18 21:39:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60800 to 39093. [2019-12-18 21:39:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39093 states. [2019-12-18 21:39:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39093 states to 39093 states and 124695 transitions. [2019-12-18 21:39:33,017 INFO L78 Accepts]: Start accepts. Automaton has 39093 states and 124695 transitions. Word has length 65 [2019-12-18 21:39:33,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:33,017 INFO L462 AbstractCegarLoop]: Abstraction has 39093 states and 124695 transitions. [2019-12-18 21:39:33,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:39:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 39093 states and 124695 transitions. [2019-12-18 21:39:33,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:33,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:33,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:33,061 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:33,061 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 6 times [2019-12-18 21:39:33,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:33,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459881714] [2019-12-18 21:39:33,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:33,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459881714] [2019-12-18 21:39:33,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:33,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:39:33,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280896627] [2019-12-18 21:39:33,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:39:33,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:39:33,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:39:33,124 INFO L87 Difference]: Start difference. First operand 39093 states and 124695 transitions. Second operand 4 states. [2019-12-18 21:39:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:33,362 INFO L93 Difference]: Finished difference Result 47014 states and 149097 transitions. [2019-12-18 21:39:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:39:33,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:39:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:33,433 INFO L225 Difference]: With dead ends: 47014 [2019-12-18 21:39:33,433 INFO L226 Difference]: Without dead ends: 47014 [2019-12-18 21:39:33,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:39:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-12-18 21:39:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 36010. [2019-12-18 21:39:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-18 21:39:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-18 21:39:34,088 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-18 21:39:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:34,088 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-18 21:39:34,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:39:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-18 21:39:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:39:34,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:34,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:34,129 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:34,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:34,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-18 21:39:34,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:34,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982904978] [2019-12-18 21:39:34,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:34,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982904978] [2019-12-18 21:39:34,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:34,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:34,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214072934] [2019-12-18 21:39:34,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:34,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:34,193 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 3 states. [2019-12-18 21:39:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:34,336 INFO L93 Difference]: Finished difference Result 36010 states and 114135 transitions. [2019-12-18 21:39:34,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:34,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:39:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:34,406 INFO L225 Difference]: With dead ends: 36010 [2019-12-18 21:39:34,406 INFO L226 Difference]: Without dead ends: 36010 [2019-12-18 21:39:34,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36010 states. [2019-12-18 21:39:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36010 to 31976. [2019-12-18 21:39:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-18 21:39:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-18 21:39:34,965 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 65 [2019-12-18 21:39:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:34,966 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-18 21:39:34,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-18 21:39:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:39:35,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:35,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:35,001 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-18 21:39:35,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:35,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977462794] [2019-12-18 21:39:35,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:35,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977462794] [2019-12-18 21:39:35,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:35,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:39:35,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445083984] [2019-12-18 21:39:35,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:39:35,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:39:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:35,066 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 3 states. [2019-12-18 21:39:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:35,185 INFO L93 Difference]: Finished difference Result 26693 states and 84212 transitions. [2019-12-18 21:39:35,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:39:35,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:39:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:35,235 INFO L225 Difference]: With dead ends: 26693 [2019-12-18 21:39:35,235 INFO L226 Difference]: Without dead ends: 26693 [2019-12-18 21:39:35,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:39:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26693 states. [2019-12-18 21:39:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26693 to 24273. [2019-12-18 21:39:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-18 21:39:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-18 21:39:35,872 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-18 21:39:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:35,872 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-18 21:39:35,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:39:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-18 21:39:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:35,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:35,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:35,902 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:35,905 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-18 21:39:35,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:35,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816697383] [2019-12-18 21:39:35,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:36,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816697383] [2019-12-18 21:39:36,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:36,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:39:36,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025422005] [2019-12-18 21:39:36,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:39:36,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:36,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:39:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:39:36,124 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 10 states. [2019-12-18 21:39:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:37,785 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-18 21:39:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:39:37,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:39:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:37,847 INFO L225 Difference]: With dead ends: 35523 [2019-12-18 21:39:37,847 INFO L226 Difference]: Without dead ends: 28791 [2019-12-18 21:39:37,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:39:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-18 21:39:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-18 21:39:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-18 21:39:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-18 21:39:38,317 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-18 21:39:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:38,317 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-18 21:39:38,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:39:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-18 21:39:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:38,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:38,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:38,344 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-18 21:39:38,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:38,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465056617] [2019-12-18 21:39:38,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:38,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465056617] [2019-12-18 21:39:38,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:38,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:39:38,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54712591] [2019-12-18 21:39:38,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:39:38,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:38,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:39:38,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:39:38,532 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 10 states. [2019-12-18 21:39:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:39,744 INFO L93 Difference]: Finished difference Result 36137 states and 112823 transitions. [2019-12-18 21:39:39,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:39:39,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:39:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:39,790 INFO L225 Difference]: With dead ends: 36137 [2019-12-18 21:39:39,790 INFO L226 Difference]: Without dead ends: 30919 [2019-12-18 21:39:39,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:39:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30919 states. [2019-12-18 21:39:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30919 to 25169. [2019-12-18 21:39:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-18 21:39:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-18 21:39:40,224 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-18 21:39:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:40,224 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-18 21:39:40,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:39:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-18 21:39:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:40,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:40,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:40,252 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-18 21:39:40,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:40,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388650968] [2019-12-18 21:39:40,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:40,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388650968] [2019-12-18 21:39:40,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:40,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:39:40,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971856617] [2019-12-18 21:39:40,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:39:40,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:39:40,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:40,428 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 11 states. [2019-12-18 21:39:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:41,793 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-18 21:39:41,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:39:41,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:39:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:41,840 INFO L225 Difference]: With dead ends: 34459 [2019-12-18 21:39:41,840 INFO L226 Difference]: Without dead ends: 30448 [2019-12-18 21:39:41,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:39:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-18 21:39:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-18 21:39:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-18 21:39:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-18 21:39:42,458 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-18 21:39:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:42,459 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-18 21:39:42,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-18 21:39:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:42,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:42,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:42,489 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:42,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-18 21:39:42,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:42,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48480140] [2019-12-18 21:39:42,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:42,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48480140] [2019-12-18 21:39:42,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:42,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:39:42,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548461079] [2019-12-18 21:39:42,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:39:42,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:42,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:39:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:42,666 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 11 states. [2019-12-18 21:39:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:43,956 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-18 21:39:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 21:39:43,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:39:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:44,030 INFO L225 Difference]: With dead ends: 50603 [2019-12-18 21:39:44,031 INFO L226 Difference]: Without dead ends: 48055 [2019-12-18 21:39:44,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 21:39:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-18 21:39:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-18 21:39:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-18 21:39:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-18 21:39:44,633 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-18 21:39:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:44,633 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-18 21:39:44,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-18 21:39:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:44,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:44,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:44,665 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:44,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-18 21:39:44,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:44,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297028883] [2019-12-18 21:39:44,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:44,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297028883] [2019-12-18 21:39:44,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:44,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:39:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192542242] [2019-12-18 21:39:44,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:39:44,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:44,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:39:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:39:44,807 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 11 states. [2019-12-18 21:39:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:45,780 INFO L93 Difference]: Finished difference Result 48656 states and 152081 transitions. [2019-12-18 21:39:45,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 21:39:45,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:39:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:45,843 INFO L225 Difference]: With dead ends: 48656 [2019-12-18 21:39:45,843 INFO L226 Difference]: Without dead ends: 40243 [2019-12-18 21:39:45,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:39:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40243 states. [2019-12-18 21:39:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40243 to 23379. [2019-12-18 21:39:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23379 states. [2019-12-18 21:39:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23379 states to 23379 states and 72980 transitions. [2019-12-18 21:39:46,356 INFO L78 Accepts]: Start accepts. Automaton has 23379 states and 72980 transitions. Word has length 67 [2019-12-18 21:39:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:46,356 INFO L462 AbstractCegarLoop]: Abstraction has 23379 states and 72980 transitions. [2019-12-18 21:39:46,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:39:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 23379 states and 72980 transitions. [2019-12-18 21:39:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:46,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:46,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:46,382 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:46,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 6 times [2019-12-18 21:39:46,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:46,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121748897] [2019-12-18 21:39:46,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:39:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:39:46,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121748897] [2019-12-18 21:39:46,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:39:46,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:39:46,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594154368] [2019-12-18 21:39:46,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:39:46,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:39:46,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:39:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:39:46,555 INFO L87 Difference]: Start difference. First operand 23379 states and 72980 transitions. Second operand 12 states. [2019-12-18 21:39:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:39:48,320 INFO L93 Difference]: Finished difference Result 27678 states and 86033 transitions. [2019-12-18 21:39:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 21:39:48,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 21:39:48,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:39:48,361 INFO L225 Difference]: With dead ends: 27678 [2019-12-18 21:39:48,361 INFO L226 Difference]: Without dead ends: 27435 [2019-12-18 21:39:48,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-18 21:39:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27435 states. [2019-12-18 21:39:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27435 to 23203. [2019-12-18 21:39:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23203 states. [2019-12-18 21:39:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 72508 transitions. [2019-12-18 21:39:48,752 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 72508 transitions. Word has length 67 [2019-12-18 21:39:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:39:48,752 INFO L462 AbstractCegarLoop]: Abstraction has 23203 states and 72508 transitions. [2019-12-18 21:39:48,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:39:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 72508 transitions. [2019-12-18 21:39:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:39:48,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:39:48,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:39:48,782 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:39:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:39:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 7 times [2019-12-18 21:39:48,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:39:48,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651648836] [2019-12-18 21:39:48,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:39:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:39:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:39:48,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:39:48,891 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:39:48,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= |v_ULTIMATE.start_main_~#t1312~0.offset_16| 0) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1312~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1312~0.base_21|) |v_ULTIMATE.start_main_~#t1312~0.offset_16| 0)) |v_#memory_int_17|) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1312~0.base_21|) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1312~0.base_21| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1312~0.base_21|) 0) (= 0 v_~z$r_buff1_thd3~0_50) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1312~0.base_21| 4)) (= 0 v_~z$w_buff1~0_26) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1314~0.offset=|v_ULTIMATE.start_main_~#t1314~0.offset_15|, ULTIMATE.start_main_~#t1314~0.base=|v_ULTIMATE.start_main_~#t1314~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, 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|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_~#t1312~0.base=|v_ULTIMATE.start_main_~#t1312~0.base_21|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t1313~0.base=|v_ULTIMATE.start_main_~#t1313~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1313~0.offset=|v_ULTIMATE.start_main_~#t1313~0.offset_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ULTIMATE.start_main_~#t1312~0.offset=|v_ULTIMATE.start_main_~#t1312~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1314~0.offset, ULTIMATE.start_main_~#t1314~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1312~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1313~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1313~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1312~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:39:48,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1313~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1313~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1313~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1313~0.base_11|) |v_ULTIMATE.start_main_~#t1313~0.offset_9| 1))) (= 0 |v_ULTIMATE.start_main_~#t1313~0.offset_9|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1313~0.base_11| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1313~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1313~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1313~0.offset=|v_ULTIMATE.start_main_~#t1313~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1313~0.base=|v_ULTIMATE.start_main_~#t1313~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1313~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1313~0.base] because there is no mapped edge [2019-12-18 21:39:48,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:39:48,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1167513280 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1167513280 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1167513280| ~z$w_buff1~0_In1167513280)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1167513280| ~z~0_In1167513280) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1167513280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167513280, ~z$w_buff1~0=~z$w_buff1~0_In1167513280, ~z~0=~z~0_In1167513280} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1167513280|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1167513280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167513280, ~z$w_buff1~0=~z$w_buff1~0_In1167513280, ~z~0=~z~0_In1167513280} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 21:39:48,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 21:39:48,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1314~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1314~0.base_13|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1314~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1314~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1314~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1314~0.base_13|) |v_ULTIMATE.start_main_~#t1314~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1314~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1314~0.offset=|v_ULTIMATE.start_main_~#t1314~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1314~0.base=|v_ULTIMATE.start_main_~#t1314~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1314~0.offset, ULTIMATE.start_main_~#t1314~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 21:39:48,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1327075314 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1327075314 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1327075314|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1327075314| ~z$w_buff0_used~0_In1327075314)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1327075314, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1327075314} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1327075314, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1327075314|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1327075314} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 21:39:48,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1573044469 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1573044469 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1573044469 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1573044469 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1573044469| ~z$w_buff1_used~0_In-1573044469) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1573044469|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573044469, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573044469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573044469, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573044469} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573044469, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1573044469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1573044469, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1573044469|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1573044469} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 21:39:48,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-869146186 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-869146186 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-869146186| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-869146186 |P1Thread1of1ForFork2_#t~ite13_Out-869146186|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-869146186, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-869146186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-869146186, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-869146186|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-869146186} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 21:39:48,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-137159647 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-137159647| ~z$w_buff0_used~0_In-137159647) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In-137159647| |P2Thread1of1ForFork0_#t~ite26_Out-137159647|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-137159647| |P2Thread1of1ForFork0_#t~ite26_Out-137159647|) .cse0 (= ~z$w_buff0_used~0_In-137159647 |P2Thread1of1ForFork0_#t~ite26_Out-137159647|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-137159647 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-137159647 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-137159647 256) 0) (and (= (mod ~z$w_buff1_used~0_In-137159647 256) 0) .cse1)))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-137159647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-137159647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137159647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-137159647, ~weak$$choice2~0=~weak$$choice2~0_In-137159647} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-137159647|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-137159647|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137159647, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-137159647, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-137159647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-137159647, ~weak$$choice2~0=~weak$$choice2~0_In-137159647} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 21:39:48,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:39:48,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In460284209 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In460284209 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out460284209| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out460284209| ~z$w_buff0_used~0_In460284209)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In460284209, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In460284209} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out460284209|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In460284209, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In460284209} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 21:39:48,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 21:39:48,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1515276168 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1515276168 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out1515276168| |P2Thread1of1ForFork0_#t~ite39_Out1515276168|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1515276168| ~z$w_buff1~0_In1515276168)) (and (or .cse0 .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1515276168| ~z~0_In1515276168) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1515276168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515276168, ~z$w_buff1~0=~z$w_buff1~0_In1515276168, ~z~0=~z~0_In1515276168} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1515276168|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1515276168|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1515276168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1515276168, ~z$w_buff1~0=~z$w_buff1~0_In1515276168, ~z~0=~z~0_In1515276168} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 21:39:48,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1351494881 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1351494881 256) 0))) (or (and (= ~z$w_buff0_used~0_In1351494881 |P2Thread1of1ForFork0_#t~ite40_Out1351494881|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1351494881|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1351494881, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1351494881} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1351494881, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1351494881|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1351494881} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 21:39:48,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In2077767534 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In2077767534 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2077767534 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In2077767534 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2077767534 |P2Thread1of1ForFork0_#t~ite41_Out2077767534|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out2077767534|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2077767534, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2077767534} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2077767534, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2077767534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2077767534, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2077767534, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out2077767534|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 21:39:48,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1897591922 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1897591922 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1897591922|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1897591922 |P2Thread1of1ForFork0_#t~ite42_Out-1897591922|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897591922, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1897591922} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1897591922, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1897591922, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1897591922|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 21:39:48,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-119607970 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-119607970 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-119607970 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-119607970 256)))) (or (and (= ~z$r_buff1_thd3~0_In-119607970 |P2Thread1of1ForFork0_#t~ite43_Out-119607970|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-119607970| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-119607970, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-119607970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119607970, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-119607970} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-119607970|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-119607970, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-119607970, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119607970, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-119607970} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 21:39:48,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:39:48,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1297609209 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In1297609209 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1297609209 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1297609209 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1297609209| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1297609209 |P0Thread1of1ForFork1_#t~ite6_Out1297609209|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1297609209, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1297609209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297609209, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1297609209} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1297609209, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1297609209|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1297609209, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1297609209, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1297609209} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 21:39:48,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1276435502 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1276435502 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In1276435502 ~z$r_buff0_thd1~0_Out1276435502) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1276435502)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1276435502} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1276435502, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1276435502|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1276435502} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:39:48,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-355473050 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-355473050 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-355473050 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-355473050 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-355473050|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-355473050 |P0Thread1of1ForFork1_#t~ite8_Out-355473050|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-355473050, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-355473050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-355473050, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-355473050} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-355473050|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-355473050, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-355473050, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-355473050, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-355473050} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 21:39:48,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 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|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:39:48,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1251561873 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-1251561873 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1251561873 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1251561873 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1251561873| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1251561873| ~z$r_buff1_thd2~0_In-1251561873)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1251561873, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1251561873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1251561873, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1251561873} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1251561873, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1251561873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1251561873, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1251561873|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1251561873} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 21:39:48,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 21:39:48,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: 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-18 21:39:48,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-2007003128 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2007003128 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-2007003128| |ULTIMATE.start_main_#t~ite47_Out-2007003128|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In-2007003128 |ULTIMATE.start_main_#t~ite47_Out-2007003128|)) (and (= ~z~0_In-2007003128 |ULTIMATE.start_main_#t~ite47_Out-2007003128|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007003128, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007003128, ~z$w_buff1~0=~z$w_buff1~0_In-2007003128, ~z~0=~z~0_In-2007003128} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2007003128, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2007003128|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2007003128, ~z$w_buff1~0=~z$w_buff1~0_In-2007003128, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2007003128|, ~z~0=~z~0_In-2007003128} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 21:39:48,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In102759287 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In102759287 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out102759287|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In102759287 |ULTIMATE.start_main_#t~ite49_Out102759287|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102759287, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102759287} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In102759287, ~z$w_buff0_used~0=~z$w_buff0_used~0_In102759287, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out102759287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 21:39:48,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-666893180 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-666893180 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-666893180 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-666893180 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-666893180| 0)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-666893180 |ULTIMATE.start_main_#t~ite50_Out-666893180|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-666893180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-666893180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-666893180} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-666893180|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-666893180, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-666893180, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-666893180, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-666893180} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 21:39:48,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-125012887 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-125012887 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-125012887 |ULTIMATE.start_main_#t~ite51_Out-125012887|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-125012887|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-125012887, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-125012887} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-125012887, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-125012887|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-125012887} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 21:39:48,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1447513033 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1447513033 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1447513033 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1447513033 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1447513033| ~z$r_buff1_thd0~0_In1447513033) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out1447513033| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1447513033, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447513033, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1447513033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1447513033} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1447513033|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1447513033, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1447513033, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1447513033, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1447513033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 21:39:48,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:39:49,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:39:49 BasicIcfg [2019-12-18 21:39:49,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:39:49,018 INFO L168 Benchmark]: Toolchain (without parser) took 108839.79 ms. Allocated memory was 139.5 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,019 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 883.62 ms. Allocated memory was 139.5 MB in the beginning and 206.0 MB in the end (delta: 66.6 MB). Free memory was 102.0 MB in the beginning and 159.2 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.99 ms. Allocated memory is still 206.0 MB. Free memory was 159.2 MB in the beginning and 156.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,020 INFO L168 Benchmark]: Boogie Preprocessor took 43.01 ms. Allocated memory is still 206.0 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,021 INFO L168 Benchmark]: RCFGBuilder took 909.10 ms. Allocated memory is still 206.0 MB. Free memory was 154.5 MB in the beginning and 103.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,021 INFO L168 Benchmark]: TraceAbstraction took 106915.30 ms. Allocated memory was 206.0 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 21:39:49,025 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 883.62 ms. Allocated memory was 139.5 MB in the beginning and 206.0 MB in the end (delta: 66.6 MB). Free memory was 102.0 MB in the beginning and 159.2 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.99 ms. Allocated memory is still 206.0 MB. Free memory was 159.2 MB in the beginning and 156.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.01 ms. Allocated memory is still 206.0 MB. Free memory was 156.5 MB in the beginning and 154.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.10 ms. Allocated memory is still 206.0 MB. Free memory was 154.5 MB in the beginning and 103.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106915.30 ms. Allocated memory was 206.0 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 103.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1312, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1313, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1314, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 106.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 29.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6742 SDtfs, 7927 SDslu, 23574 SDs, 0 SdLazy, 11480 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 44 SyntacticMatches, 13 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 45.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 322651 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1394 ConstructedInterpolants, 0 QuantifiedInterpolants, 260920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...