/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:20:34,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:20:34,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:20:34,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:20:34,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:20:34,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:20:34,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:20:34,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:20:34,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:20:34,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:20:34,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:20:34,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:20:34,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:20:34,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:20:34,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:20:34,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:20:34,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:20:34,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:20:34,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:20:34,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:20:34,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:20:34,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:20:34,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:20:34,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:20:34,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:20:34,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:20:34,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:20:35,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:20:35,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:20:35,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:20:35,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:20:35,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:20:35,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:20:35,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:20:35,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:20:35,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:20:35,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:20:35,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:20:35,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:20:35,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:20:35,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:20:35,012 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 01:20:35,050 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:20:35,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:20:35,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:20:35,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:20:35,052 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:20:35,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:20:35,052 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:20:35,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:20:35,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:20:35,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:20:35,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:20:35,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:20:35,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:20:35,055 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:20:35,055 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:20:35,055 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:20:35,056 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:20:35,056 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:20:35,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:20:35,056 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:20:35,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:20:35,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:20:35,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:20:35,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:20:35,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:20:35,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:20:35,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:20:35,058 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:20:35,058 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:20:35,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:20:35,058 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:20:35,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:20:35,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:20:35,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:20:35,354 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:20:35,355 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:20:35,356 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2020-10-06 01:20:35,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629632be0/5685467385694d7cbfa212eac5cebce9/FLAG887139a1e [2020-10-06 01:20:35,954 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:20:35,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2020-10-06 01:20:35,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629632be0/5685467385694d7cbfa212eac5cebce9/FLAG887139a1e [2020-10-06 01:20:36,278 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629632be0/5685467385694d7cbfa212eac5cebce9 [2020-10-06 01:20:36,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:20:36,287 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:20:36,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:20:36,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:20:36,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:20:36,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:20:36" (1/1) ... [2020-10-06 01:20:36,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfde104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:36, skipping insertion in model container [2020-10-06 01:20:36,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:20:36" (1/1) ... [2020-10-06 01:20:36,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:20:36,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:20:36,556 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-06 01:20:37,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:20:37,089 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:20:37,102 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-06 01:20:37,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:20:37,308 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:20:37,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37 WrapperNode [2020-10-06 01:20:37,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:20:37,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:20:37,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:20:37,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:20:37,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:20:37,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:20:37,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:20:37,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:20:37,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (1/1) ... [2020-10-06 01:20:37,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:20:37,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:20:37,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:20:37,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:20:37,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (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 [2020-10-06 01:20:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-10-06 01:20:37,537 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-10-06 01:20:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:20:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-06 01:20:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:20:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-06 01:20:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:20:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-06 01:20:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-06 01:20:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:20:37,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:20:37,540 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:20:38,407 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:20:38,407 INFO L298 CfgBuilder]: Removed 40 assume(true) statements. [2020-10-06 01:20:38,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:20:38 BoogieIcfgContainer [2020-10-06 01:20:38,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:20:38,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:20:38,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:20:38,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:20:38,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:20:36" (1/3) ... [2020-10-06 01:20:38,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24009425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:20:38, skipping insertion in model container [2020-10-06 01:20:38,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:20:37" (2/3) ... [2020-10-06 01:20:38,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24009425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:20:38, skipping insertion in model container [2020-10-06 01:20:38,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:20:38" (3/3) ... [2020-10-06 01:20:38,418 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2020-10-06 01:20:38,428 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:20:38,428 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:20:38,437 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-10-06 01:20:38,438 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:20:38,482 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,483 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,483 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,483 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,483 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,484 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,484 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,484 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,484 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,484 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,485 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,485 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,485 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,485 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,485 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,486 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,486 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,486 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,486 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,486 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,486 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,487 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,487 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,487 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,487 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,487 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,488 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,488 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,488 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,488 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,488 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,488 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,489 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,489 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,489 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,489 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,489 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,489 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,490 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,490 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,490 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,490 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,490 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,491 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,491 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,491 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,491 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,491 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,491 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,492 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,492 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,492 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,492 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,492 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,493 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,493 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,493 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,493 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,493 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,494 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,494 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,494 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,494 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,494 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,495 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,495 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,495 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,495 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,495 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,495 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,496 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,496 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,496 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,496 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,496 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,497 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,497 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,497 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,497 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,497 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,498 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,498 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,498 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,498 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,498 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,498 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,499 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,499 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,499 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,499 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,499 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,500 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,501 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,501 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,501 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,501 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,501 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,501 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,502 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,502 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,505 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,505 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,505 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,505 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,506 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,507 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,507 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,508 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,508 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,509 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,509 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,509 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,509 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,509 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,509 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,510 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,510 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,510 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,510 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,510 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,511 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,511 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,511 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,511 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,511 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,511 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,512 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,512 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,512 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,512 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,512 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,512 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,513 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,513 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,513 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,513 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,513 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,513 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,514 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,514 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,514 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,514 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,514 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,514 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,515 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,515 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,515 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,515 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,515 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,515 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,516 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,516 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,517 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,517 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,517 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,517 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,517 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,518 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,519 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,519 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,519 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,519 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,520 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,520 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,520 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,520 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,520 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,520 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,521 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,521 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,521 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,521 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,521 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,521 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,522 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,522 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,522 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,522 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,528 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,528 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,529 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,529 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,529 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,529 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,529 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,529 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,530 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,530 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,530 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,530 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,530 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,531 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,531 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,531 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,531 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,531 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,531 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,532 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,532 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,532 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,532 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,532 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,533 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,533 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,533 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,533 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,534 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,535 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,538 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,538 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,538 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,539 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,539 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,539 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,539 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,539 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,540 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,542 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,543 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,543 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,544 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,549 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:20:38,569 INFO L251 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-06 01:20:38,589 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:20:38,589 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:20:38,589 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:20:38,589 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:20:38,590 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:20:38,590 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:20:38,590 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:20:38,590 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:20:38,616 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 426 places, 455 transitions, 918 flow [2020-10-06 01:20:38,618 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 918 flow [2020-10-06 01:20:38,848 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-10-06 01:20:38,848 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-06 01:20:38,864 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2020-10-06 01:20:38,893 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions, 918 flow [2020-10-06 01:20:38,993 INFO L129 PetriNetUnfolder]: 33/454 cut-off events. [2020-10-06 01:20:38,993 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-06 01:20:39,001 INFO L80 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2020-10-06 01:20:39,034 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31742 [2020-10-06 01:20:39,036 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:20:40,312 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:40,334 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:40,335 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:40,335 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-10-06 01:20:40,585 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:40,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:40,597 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:40,598 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-10-06 01:20:42,531 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:42,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:42,545 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:42,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2020-10-06 01:20:44,051 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-10-06 01:20:44,072 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:44,188 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-06 01:20:44,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:44,189 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:44,190 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:181 [2020-10-06 01:20:44,299 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-06 01:20:44,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 01:20:45,726 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-06 01:20:45,967 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-10-06 01:20:46,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-06 01:20:47,182 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2020-10-06 01:20:47,344 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2020-10-06 01:20:47,858 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-06 01:20:48,235 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-06 01:20:48,524 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-10-06 01:20:48,713 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-06 01:20:49,152 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-06 01:20:49,541 WARN L193 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-06 01:20:50,714 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 178 DAG size of output: 165 [2020-10-06 01:20:50,739 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:51,309 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-10-06 01:20:51,310 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:51,311 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:51,311 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2020-10-06 01:20:51,859 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-10-06 01:20:51,902 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73353 [2020-10-06 01:20:51,902 INFO L214 etLargeBlockEncoding]: Total number of compositions: 424 [2020-10-06 01:20:51,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 122 transitions, 252 flow [2020-10-06 01:20:51,948 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1490 states. [2020-10-06 01:20:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states. [2020-10-06 01:20:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-06 01:20:51,955 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:51,955 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-06 01:20:51,956 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1591, now seen corresponding path program 1 times [2020-10-06 01:20:51,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:51,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735215417] [2020-10-06 01:20:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:52,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735215417] [2020-10-06 01:20:52,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:52,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-06 01:20:52,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [353118851] [2020-10-06 01:20:52,084 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:52,086 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:52,093 INFO L258 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-10-06 01:20:52,094 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:52,097 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:52,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-06 01:20:52,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-06 01:20:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-06 01:20:52,115 INFO L87 Difference]: Start difference. First operand 1490 states. Second operand 2 states. [2020-10-06 01:20:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:52,159 INFO L93 Difference]: Finished difference Result 1489 states and 3337 transitions. [2020-10-06 01:20:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-06 01:20:52,160 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-06 01:20:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:52,193 INFO L225 Difference]: With dead ends: 1489 [2020-10-06 01:20:52,193 INFO L226 Difference]: Without dead ends: 1469 [2020-10-06 01:20:52,194 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-06 01:20:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-10-06 01:20:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2020-10-06 01:20:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2020-10-06 01:20:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2020-10-06 01:20:52,364 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 1 [2020-10-06 01:20:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:52,364 INFO L479 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2020-10-06 01:20:52,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-06 01:20:52,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2020-10-06 01:20:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-06 01:20:52,366 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:52,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-06 01:20:52,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:20:52,366 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:52,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash -651818284, now seen corresponding path program 1 times [2020-10-06 01:20:52,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:52,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227360836] [2020-10-06 01:20:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:52,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227360836] [2020-10-06 01:20:52,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:52,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:20:52,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1644593894] [2020-10-06 01:20:52,479 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:52,480 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:52,481 INFO L258 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-10-06 01:20:52,481 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:52,482 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:52,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:20:52,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:20:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:20:52,484 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 transitions. Second operand 3 states. [2020-10-06 01:20:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:52,535 INFO L93 Difference]: Finished difference Result 2761 states and 6206 transitions. [2020-10-06 01:20:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:20:52,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-06 01:20:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:52,555 INFO L225 Difference]: With dead ends: 2761 [2020-10-06 01:20:52,555 INFO L226 Difference]: Without dead ends: 2761 [2020-10-06 01:20:52,556 INFO L675 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 [2020-10-06 01:20:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2020-10-06 01:20:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1488. [2020-10-06 01:20:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-10-06 01:20:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3336 transitions. [2020-10-06 01:20:52,668 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3336 transitions. Word has length 6 [2020-10-06 01:20:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:52,669 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 3336 transitions. [2020-10-06 01:20:52,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:20:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3336 transitions. [2020-10-06 01:20:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:20:52,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:52,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:52,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:20:52,672 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:52,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1267854911, now seen corresponding path program 1 times [2020-10-06 01:20:52,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:52,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223186784] [2020-10-06 01:20:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:52,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223186784] [2020-10-06 01:20:52,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:52,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:20:52,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620899118] [2020-10-06 01:20:52,769 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:52,769 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:52,770 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:20:52,771 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:52,771 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:52,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:20:52,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:52,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:20:52,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:20:52,772 INFO L87 Difference]: Start difference. First operand 1488 states and 3336 transitions. Second operand 3 states. [2020-10-06 01:20:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:52,788 INFO L93 Difference]: Finished difference Result 1488 states and 3317 transitions. [2020-10-06 01:20:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:20:52,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 01:20:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:52,797 INFO L225 Difference]: With dead ends: 1488 [2020-10-06 01:20:52,797 INFO L226 Difference]: Without dead ends: 1488 [2020-10-06 01:20:52,798 INFO L675 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 [2020-10-06 01:20:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2020-10-06 01:20:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2020-10-06 01:20:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2020-10-06 01:20:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3317 transitions. [2020-10-06 01:20:52,837 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3317 transitions. Word has length 7 [2020-10-06 01:20:52,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:52,837 INFO L479 AbstractCegarLoop]: Abstraction has 1488 states and 3317 transitions. [2020-10-06 01:20:52,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:20:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3317 transitions. [2020-10-06 01:20:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:20:52,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:52,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:52,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:20:52,839 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:52,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:52,839 INFO L82 PathProgramCache]: Analyzing trace with hash 660801943, now seen corresponding path program 1 times [2020-10-06 01:20:52,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:52,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459199907] [2020-10-06 01:20:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:53,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459199907] [2020-10-06 01:20:53,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:53,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:20:53,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [269608503] [2020-10-06 01:20:53,021 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:53,022 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:53,024 INFO L258 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-06 01:20:53,024 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:53,024 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:53,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:20:53,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:20:53,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:20:53,026 INFO L87 Difference]: Start difference. First operand 1488 states and 3317 transitions. Second operand 5 states. [2020-10-06 01:20:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:53,492 INFO L93 Difference]: Finished difference Result 1864 states and 4157 transitions. [2020-10-06 01:20:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:20:53,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-06 01:20:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:53,503 INFO L225 Difference]: With dead ends: 1864 [2020-10-06 01:20:53,503 INFO L226 Difference]: Without dead ends: 1864 [2020-10-06 01:20:53,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:20:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2020-10-06 01:20:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1595. [2020-10-06 01:20:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-10-06 01:20:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3562 transitions. [2020-10-06 01:20:53,544 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3562 transitions. Word has length 8 [2020-10-06 01:20:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:53,544 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 3562 transitions. [2020-10-06 01:20:53,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:20:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3562 transitions. [2020-10-06 01:20:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:20:53,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:53,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:53,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:20:53,547 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -624152238, now seen corresponding path program 1 times [2020-10-06 01:20:53,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:53,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748285939] [2020-10-06 01:20:53,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:53,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748285939] [2020-10-06 01:20:53,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:53,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:20:53,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2038196083] [2020-10-06 01:20:53,595 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:53,596 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:53,598 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-06 01:20:53,598 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:53,599 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:53,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:20:53,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:20:53,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:20:53,600 INFO L87 Difference]: Start difference. First operand 1595 states and 3562 transitions. Second operand 3 states. [2020-10-06 01:20:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:53,666 INFO L93 Difference]: Finished difference Result 2622 states and 5848 transitions. [2020-10-06 01:20:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:20:53,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 01:20:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:53,681 INFO L225 Difference]: With dead ends: 2622 [2020-10-06 01:20:53,681 INFO L226 Difference]: Without dead ends: 2622 [2020-10-06 01:20:53,681 INFO L675 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 [2020-10-06 01:20:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2020-10-06 01:20:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1652. [2020-10-06 01:20:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2020-10-06 01:20:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3682 transitions. [2020-10-06 01:20:53,728 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3682 transitions. Word has length 10 [2020-10-06 01:20:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:53,729 INFO L479 AbstractCegarLoop]: Abstraction has 1652 states and 3682 transitions. [2020-10-06 01:20:53,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:20:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3682 transitions. [2020-10-06 01:20:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:20:53,731 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:53,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:53,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:20:53,732 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1495626362, now seen corresponding path program 1 times [2020-10-06 01:20:53,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:53,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237427434] [2020-10-06 01:20:53,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:53,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237427434] [2020-10-06 01:20:53,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:53,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:20:53,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [310455979] [2020-10-06 01:20:53,863 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:53,867 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:53,872 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-10-06 01:20:53,872 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:53,897 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:20:53,897 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:20:53,900 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:53,900 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_110| vanished before elimination [2020-10-06 01:20:53,901 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:53,901 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2020-10-06 01:20:53,909 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:20:53,909 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:20:53,911 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:53,912 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_111| vanished before elimination [2020-10-06 01:20:53,912 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:20:53,913 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2020-10-06 01:20:53,913 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:53,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 01:20:53,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 01:20:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:20:53,914 INFO L87 Difference]: Start difference. First operand 1652 states and 3682 transitions. Second operand 9 states. [2020-10-06 01:20:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:55,132 INFO L93 Difference]: Finished difference Result 2266 states and 5011 transitions. [2020-10-06 01:20:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-06 01:20:55,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-06 01:20:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:55,144 INFO L225 Difference]: With dead ends: 2266 [2020-10-06 01:20:55,144 INFO L226 Difference]: Without dead ends: 2266 [2020-10-06 01:20:55,145 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:20:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2020-10-06 01:20:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 1679. [2020-10-06 01:20:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2020-10-06 01:20:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3742 transitions. [2020-10-06 01:20:55,187 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3742 transitions. Word has length 14 [2020-10-06 01:20:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:55,188 INFO L479 AbstractCegarLoop]: Abstraction has 1679 states and 3742 transitions. [2020-10-06 01:20:55,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 01:20:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3742 transitions. [2020-10-06 01:20:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:20:55,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:55,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:55,189 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:20:55,190 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 341856152, now seen corresponding path program 2 times [2020-10-06 01:20:55,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:55,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923294323] [2020-10-06 01:20:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:55,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923294323] [2020-10-06 01:20:55,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:55,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:20:55,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [803176810] [2020-10-06 01:20:55,310 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:55,312 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:55,317 INFO L258 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-10-06 01:20:55,317 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:55,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:20:55,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-06 01:20:55,337 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:20:55,341 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-06 01:20:55,343 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:20:55,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:55,357 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:20:55,358 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:16 [2020-10-06 01:20:55,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:20:55,392 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:20:55,392 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:20:55,393 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:20:55,394 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:20:55,405 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:20:55,406 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:20:55,406 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:16 [2020-10-06 01:20:55,461 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [34697#(and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (or (<= |#StackHeapBarrier| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.base 0))), 34698#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (or (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#q~1.base|) (= |ULTIMATE.start_main_~#q~1.base| 0))), 34699#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))] [2020-10-06 01:20:55,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-06 01:20:55,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-06 01:20:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-06 01:20:55,462 INFO L87 Difference]: Start difference. First operand 1679 states and 3742 transitions. Second operand 12 states. [2020-10-06 01:20:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:56,827 INFO L93 Difference]: Finished difference Result 2143 states and 4753 transitions. [2020-10-06 01:20:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-06 01:20:56,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2020-10-06 01:20:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:56,838 INFO L225 Difference]: With dead ends: 2143 [2020-10-06 01:20:56,838 INFO L226 Difference]: Without dead ends: 2143 [2020-10-06 01:20:56,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2020-10-06 01:20:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2020-10-06 01:20:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1679. [2020-10-06 01:20:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2020-10-06 01:20:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 3742 transitions. [2020-10-06 01:20:56,877 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 3742 transitions. Word has length 14 [2020-10-06 01:20:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:56,877 INFO L479 AbstractCegarLoop]: Abstraction has 1679 states and 3742 transitions. [2020-10-06 01:20:56,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-06 01:20:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 3742 transitions. [2020-10-06 01:20:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:20:56,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:56,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:56,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:20:56,879 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash -70509489, now seen corresponding path program 1 times [2020-10-06 01:20:56,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:56,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118573621] [2020-10-06 01:20:56,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:57,004 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118573621] [2020-10-06 01:20:57,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:57,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-06 01:20:57,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1721004406] [2020-10-06 01:20:57,005 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:57,008 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:57,011 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-10-06 01:20:57,011 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:57,011 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:20:57,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-06 01:20:57,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-06 01:20:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:20:57,012 INFO L87 Difference]: Start difference. First operand 1679 states and 3742 transitions. Second operand 8 states. [2020-10-06 01:20:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:57,978 INFO L93 Difference]: Finished difference Result 2534 states and 5609 transitions. [2020-10-06 01:20:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-06 01:20:57,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-06 01:20:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:57,992 INFO L225 Difference]: With dead ends: 2534 [2020-10-06 01:20:57,992 INFO L226 Difference]: Without dead ends: 2443 [2020-10-06 01:20:57,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2020-10-06 01:20:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2020-10-06 01:20:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 1848. [2020-10-06 01:20:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2020-10-06 01:20:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 4169 transitions. [2020-10-06 01:20:58,036 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 4169 transitions. Word has length 14 [2020-10-06 01:20:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:58,036 INFO L479 AbstractCegarLoop]: Abstraction has 1848 states and 4169 transitions. [2020-10-06 01:20:58,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-06 01:20:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 4169 transitions. [2020-10-06 01:20:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:20:58,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:58,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:58,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:20:58,038 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:58,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1644221894, now seen corresponding path program 1 times [2020-10-06 01:20:58,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:58,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818517240] [2020-10-06 01:20:58,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:20:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:20:58,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818517240] [2020-10-06 01:20:58,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:20:58,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 01:20:58,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [514006137] [2020-10-06 01:20:58,175 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:20:58,177 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:20:58,182 INFO L258 McrAutomatonBuilder]: Finished intersection with 40 states and 63 transitions. [2020-10-06 01:20:58,183 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:20:58,400 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [46476#(and (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) (+ ULTIMATE.start_fifo_empty_~self.offset 4)) |ULTIMATE.start_fifo_empty_#t~mem3.base|) (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) (+ ULTIMATE.start_fifo_empty_~self.offset 4)))), 46477#(and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))), 46478#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)))] [2020-10-06 01:20:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-06 01:20:58,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:20:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-06 01:20:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-06 01:20:58,401 INFO L87 Difference]: Start difference. First operand 1848 states and 4169 transitions. Second operand 10 states. [2020-10-06 01:20:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:20:59,452 INFO L93 Difference]: Finished difference Result 2102 states and 4702 transitions. [2020-10-06 01:20:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-06 01:20:59,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-06 01:20:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:20:59,475 INFO L225 Difference]: With dead ends: 2102 [2020-10-06 01:20:59,475 INFO L226 Difference]: Without dead ends: 2102 [2020-10-06 01:20:59,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-10-06 01:20:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2020-10-06 01:20:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1840. [2020-10-06 01:20:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2020-10-06 01:20:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 4134 transitions. [2020-10-06 01:20:59,516 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 4134 transitions. Word has length 15 [2020-10-06 01:20:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:20:59,517 INFO L479 AbstractCegarLoop]: Abstraction has 1840 states and 4134 transitions. [2020-10-06 01:20:59,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-06 01:20:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 4134 transitions. [2020-10-06 01:20:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:20:59,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:20:59,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:20:59,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:20:59,518 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:20:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:20:59,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1537021170, now seen corresponding path program 2 times [2020-10-06 01:20:59,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:20:59,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596974670] [2020-10-06 01:20:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:20:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:00,151 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2020-10-06 01:21:00,556 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2020-10-06 01:21:00,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:00,805 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596974670] [2020-10-06 01:21:00,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:00,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-06 01:21:00,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283365483] [2020-10-06 01:21:00,806 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:00,808 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:00,813 INFO L258 McrAutomatonBuilder]: Finished intersection with 34 states and 51 transitions. [2020-10-06 01:21:00,814 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:01,589 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [52288#(and (or (and (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4))) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|)))) (= |ULTIMATE.start_main_~#q~1.offset| 0)), 52289#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (or (= |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 0) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)))) (or (and (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12)) |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12))) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12)) |ULTIMATE.start_main_~#q~1.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12))) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12))) |ULTIMATE.start_main_~#q~1.offset|) 0))))), 52290#(and (or (and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 0) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) 12)))) (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (= |ULTIMATE.start_fifo_empty_#t~mem3.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))))) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_empty_~self.base) (= pusherThread1of1ForFork0_~q~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 52291#(and (= pusherThread1of1ForFork0_~q~0.offset 0) (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_front_~self.base) (or (and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))) (and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 0) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) 12)))))), 52292#(and (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_empty_~self.base) (or (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= |ULTIMATE.start_fifo_empty_#t~mem3.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) 12) |pusherThread1of1ForFork0_#in~q_.base|)))) (= |pusherThread1of1ForFork0_#in~q_.offset| 0) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 52293#(and (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_front_~self.base) (or (and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) 12) |pusherThread1of1ForFork0_#in~q_.base|)))) (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= |pusherThread1of1ForFork0_#in~q_.offset| 0)), 52294#(and (not (= 0 (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|))) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.offset 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (or (and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 0) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) 12)))) (and (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)))))), 52295#(and (or (and (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) 12) |pusherThread1of1ForFork0_#in~q_.base|)))) (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_#in~q_.base|) (= |pusherThread1of1ForFork0_#in~q_.offset| 0)), 52286#(and (= ULTIMATE.start_fifo_front_~self.offset 0) (or (and (= (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| ULTIMATE.start_fifo_front_~self.base)) (and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (not (= |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| ULTIMATE.start_fifo_front_~self.base))))), 52287#(and (or (= |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 0) (and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)))) (= ULTIMATE.start_fifo_front_~self.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12)) ULTIMATE.start_fifo_front_~self.base)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0))) (and (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12)) ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12))) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12))) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (+ |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 12))) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)))))] [2020-10-06 01:21:01,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-06 01:21:01,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-06 01:21:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2020-10-06 01:21:01,591 INFO L87 Difference]: Start difference. First operand 1840 states and 4134 transitions. Second operand 25 states. [2020-10-06 01:21:02,478 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-10-06 01:21:02,729 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 54 [2020-10-06 01:21:02,971 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2020-10-06 01:21:03,181 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 63 [2020-10-06 01:21:03,614 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 68 [2020-10-06 01:21:03,810 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2020-10-06 01:21:04,153 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 73 [2020-10-06 01:21:04,383 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 48 [2020-10-06 01:21:04,953 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 98 [2020-10-06 01:21:05,162 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 58 [2020-10-06 01:21:05,545 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 60 [2020-10-06 01:21:06,106 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 81 [2020-10-06 01:21:06,766 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 56 [2020-10-06 01:21:06,938 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 47 [2020-10-06 01:21:07,335 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 59 [2020-10-06 01:21:07,935 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 75 [2020-10-06 01:21:08,190 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 50 [2020-10-06 01:21:08,563 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 60 [2020-10-06 01:21:08,847 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 78 [2020-10-06 01:21:09,094 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 53 [2020-10-06 01:21:09,513 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 63 [2020-10-06 01:21:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:13,055 INFO L93 Difference]: Finished difference Result 2276 states and 5077 transitions. [2020-10-06 01:21:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-10-06 01:21:13,055 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 15 [2020-10-06 01:21:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:13,063 INFO L225 Difference]: With dead ends: 2276 [2020-10-06 01:21:13,063 INFO L226 Difference]: Without dead ends: 2276 [2020-10-06 01:21:13,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=701, Invalid=2605, Unknown=0, NotChecked=0, Total=3306 [2020-10-06 01:21:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2020-10-06 01:21:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1864. [2020-10-06 01:21:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1864 states. [2020-10-06 01:21:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 4190 transitions. [2020-10-06 01:21:13,105 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 4190 transitions. Word has length 15 [2020-10-06 01:21:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:13,106 INFO L479 AbstractCegarLoop]: Abstraction has 1864 states and 4190 transitions. [2020-10-06 01:21:13,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-06 01:21:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 4190 transitions. [2020-10-06 01:21:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:21:13,107 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:13,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:13,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:21:13,107 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2048498594, now seen corresponding path program 3 times [2020-10-06 01:21:13,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:13,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376522637] [2020-10-06 01:21:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:13,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376522637] [2020-10-06 01:21:13,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:13,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-06 01:21:13,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101019980] [2020-10-06 01:21:13,376 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:13,377 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:13,381 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 43 transitions. [2020-10-06 01:21:13,381 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:13,412 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_313|], 2=[|v_#memory_$Pointer$.base_314|]} [2020-10-06 01:21:13,414 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:13,423 INFO L625 ElimStorePlain]: treesize reduction 25, result has 34.2 percent of original size [2020-10-06 01:21:13,423 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_314| vanished before elimination [2020-10-06 01:21:13,424 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:13,424 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:13 [2020-10-06 01:21:13,449 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_314|], 2=[|v_#memory_$Pointer$.base_315|]} [2020-10-06 01:21:13,451 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:13,461 INFO L625 ElimStorePlain]: treesize reduction 25, result has 34.2 percent of original size [2020-10-06 01:21:13,461 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_315| vanished before elimination [2020-10-06 01:21:13,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:13,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:13 [2020-10-06 01:21:13,592 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [58377#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 58378#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|))), 58379#(and (= |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) 12) |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 58380#(and (= pusherThread1of1ForFork0_~q~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 0) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_front_~self.base) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) 12)))), 58381#(and (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= |pusherThread1of1ForFork0_#in~q_.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) 12) |pusherThread1of1ForFork0_#in~q_.base|)))] [2020-10-06 01:21:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-06 01:21:13,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-06 01:21:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-10-06 01:21:13,594 INFO L87 Difference]: Start difference. First operand 1864 states and 4190 transitions. Second operand 16 states. [2020-10-06 01:21:14,504 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 49 [2020-10-06 01:21:14,683 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 45 [2020-10-06 01:21:15,590 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 52 [2020-10-06 01:21:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:17,227 INFO L93 Difference]: Finished difference Result 2248 states and 5020 transitions. [2020-10-06 01:21:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-06 01:21:17,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2020-10-06 01:21:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:17,233 INFO L225 Difference]: With dead ends: 2248 [2020-10-06 01:21:17,233 INFO L226 Difference]: Without dead ends: 2248 [2020-10-06 01:21:17,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2020-10-06 01:21:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2020-10-06 01:21:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 1868. [2020-10-06 01:21:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1868 states. [2020-10-06 01:21:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 4198 transitions. [2020-10-06 01:21:17,273 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 4198 transitions. Word has length 15 [2020-10-06 01:21:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:17,274 INFO L479 AbstractCegarLoop]: Abstraction has 1868 states and 4198 transitions. [2020-10-06 01:21:17,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-06 01:21:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 4198 transitions. [2020-10-06 01:21:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:21:17,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:17,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:17,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 01:21:17,275 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:17,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash -807122092, now seen corresponding path program 1 times [2020-10-06 01:21:17,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:17,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354287883] [2020-10-06 01:21:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:17,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354287883] [2020-10-06 01:21:17,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:17,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-06 01:21:17,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1523555473] [2020-10-06 01:21:17,901 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:17,903 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:17,909 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2020-10-06 01:21:17,909 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:18,398 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [64416#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 64417#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|))), 64418#(and (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_empty_~self.base) (= pusherThread1of1ForFork0_~q~0.offset 0) (not (= (+ pusherThread1of1ForFork0_~q~0.offset 4) ULTIMATE.start_fifo_front_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)))) (= ULTIMATE.start_fifo_empty_~self.offset 0) (= |ULTIMATE.start_fifo_empty_#t~mem3.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)))), 64419#(and (= pusherThread1of1ForFork0_~q~0.offset 0) (= ULTIMATE.start_fifo_front_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_front_~self.base) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))))), 64420#(and (= |ULTIMATE.start_fifo_empty_#t~mem3.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (+ |pusherThread1of1ForFork0_#in~q_.offset| 4) ULTIMATE.start_fifo_front_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) |pusherThread1of1ForFork0_#in~q_.base|)) (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_empty_~self.base) (= |pusherThread1of1ForFork0_#in~q_.offset| 0) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 64421#(and (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) |pusherThread1of1ForFork0_#in~q_.base|)) (= ULTIMATE.start_fifo_front_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= |pusherThread1of1ForFork0_#in~q_.offset| 0)), 64414#(and (not (= ULTIMATE.start_fifo_front_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))), 64415#(and (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (not (= |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| ULTIMATE.start_fifo_front_~self.base)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)))] [2020-10-06 01:21:18,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-06 01:21:18,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:18,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-06 01:21:18,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:21:18,400 INFO L87 Difference]: Start difference. First operand 1868 states and 4198 transitions. Second operand 22 states. [2020-10-06 01:21:19,130 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 40 [2020-10-06 01:21:19,296 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2020-10-06 01:21:19,648 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 51 [2020-10-06 01:21:20,077 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2020-10-06 01:21:20,426 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 55 [2020-10-06 01:21:20,618 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2020-10-06 01:21:21,046 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 55 [2020-10-06 01:21:21,665 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 42 [2020-10-06 01:21:22,218 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 45 [2020-10-06 01:21:22,804 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 45 [2020-10-06 01:21:23,300 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 60 [2020-10-06 01:21:23,515 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 48 [2020-10-06 01:21:23,731 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 45 [2020-10-06 01:21:24,212 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 63 [2020-10-06 01:21:24,456 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 48 [2020-10-06 01:21:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:27,660 INFO L93 Difference]: Finished difference Result 3353 states and 7554 transitions. [2020-10-06 01:21:27,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-10-06 01:21:27,660 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2020-10-06 01:21:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:27,668 INFO L225 Difference]: With dead ends: 3353 [2020-10-06 01:21:27,668 INFO L226 Difference]: Without dead ends: 3353 [2020-10-06 01:21:27,669 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=607, Invalid=2363, Unknown=0, NotChecked=0, Total=2970 [2020-10-06 01:21:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2020-10-06 01:21:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2001. [2020-10-06 01:21:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2020-10-06 01:21:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 4533 transitions. [2020-10-06 01:21:27,720 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 4533 transitions. Word has length 17 [2020-10-06 01:21:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:27,721 INFO L479 AbstractCegarLoop]: Abstraction has 2001 states and 4533 transitions. [2020-10-06 01:21:27,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-06 01:21:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 4533 transitions. [2020-10-06 01:21:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:21:27,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:27,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:27,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 01:21:27,723 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:27,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:27,723 INFO L82 PathProgramCache]: Analyzing trace with hash -803345362, now seen corresponding path program 2 times [2020-10-06 01:21:27,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:27,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939611052] [2020-10-06 01:21:27,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:28,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939611052] [2020-10-06 01:21:28,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:28,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-06 01:21:28,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562932200] [2020-10-06 01:21:28,377 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:28,379 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:28,385 INFO L258 McrAutomatonBuilder]: Finished intersection with 37 states and 55 transitions. [2020-10-06 01:21:28,385 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:28,850 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [71857#(and (not (= ULTIMATE.start_fifo_front_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))), 71859#(and (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (not (= |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| ULTIMATE.start_fifo_front_~self.base)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))), 71858#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 71861#(and (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) ULTIMATE.start_fifo_empty_~self.base)) (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_empty_~self.base) (= pusherThread1of1ForFork0_~q~0.offset 0) (not (= (+ pusherThread1of1ForFork0_~q~0.offset 4) ULTIMATE.start_fifo_front_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_empty_~self.offset 0) (= |ULTIMATE.start_fifo_empty_#t~mem3.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)))), 71860#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) (+ |ULTIMATE.start_main_~#q~1.offset| 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|))), 71863#(and (= |ULTIMATE.start_fifo_empty_#t~mem3.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (+ |pusherThread1of1ForFork0_#in~q_.offset| 4) ULTIMATE.start_fifo_front_~self.offset)) (= |ULTIMATE.start_fifo_empty_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) ULTIMATE.start_fifo_empty_~self.base)) (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_empty_~self.base) (= |pusherThread1of1ForFork0_#in~q_.offset| 0) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 71862#(and (= pusherThread1of1ForFork0_~q~0.offset 0) (= ULTIMATE.start_fifo_front_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) ULTIMATE.start_fifo_front_~self.base)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_front_~self.base)), 71864#(and (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= |pusherThread1of1ForFork0_#in~q_.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) ULTIMATE.start_fifo_front_~self.base)))] [2020-10-06 01:21:28,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-06 01:21:28,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:28,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-06 01:21:28,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2020-10-06 01:21:28,852 INFO L87 Difference]: Start difference. First operand 2001 states and 4533 transitions. Second operand 22 states. [2020-10-06 01:21:29,575 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 38 [2020-10-06 01:21:29,757 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2020-10-06 01:21:30,119 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 51 [2020-10-06 01:21:30,509 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 41 [2020-10-06 01:21:30,891 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 57 [2020-10-06 01:21:31,088 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 41 [2020-10-06 01:21:31,441 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 57 [2020-10-06 01:21:32,042 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 41 [2020-10-06 01:21:32,745 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 45 [2020-10-06 01:21:32,952 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 44 [2020-10-06 01:21:33,401 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 48 [2020-10-06 01:21:33,623 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 44 [2020-10-06 01:21:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:36,116 INFO L93 Difference]: Finished difference Result 3163 states and 7175 transitions. [2020-10-06 01:21:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-10-06 01:21:36,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2020-10-06 01:21:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:36,124 INFO L225 Difference]: With dead ends: 3163 [2020-10-06 01:21:36,125 INFO L226 Difference]: Without dead ends: 3163 [2020-10-06 01:21:36,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=423, Invalid=1739, Unknown=0, NotChecked=0, Total=2162 [2020-10-06 01:21:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2020-10-06 01:21:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2032. [2020-10-06 01:21:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2020-10-06 01:21:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 4614 transitions. [2020-10-06 01:21:36,169 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 4614 transitions. Word has length 17 [2020-10-06 01:21:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:36,170 INFO L479 AbstractCegarLoop]: Abstraction has 2032 states and 4614 transitions. [2020-10-06 01:21:36,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-06 01:21:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 4614 transitions. [2020-10-06 01:21:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-06 01:21:36,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:36,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:36,171 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 01:21:36,172 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:36,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:36,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1824797056, now seen corresponding path program 3 times [2020-10-06 01:21:36,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:36,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369756334] [2020-10-06 01:21:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:36,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369756334] [2020-10-06 01:21:36,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:36,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-06 01:21:36,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [591647817] [2020-10-06 01:21:36,615 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:36,620 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:36,628 INFO L258 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2020-10-06 01:21:36,628 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:36,672 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:36,672 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:36,736 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_114| vanished before elimination [2020-10-06 01:21:36,736 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-06 01:21:36,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2020-10-06 01:21:36,771 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:21:36,782 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_316|], 2=[|v_#memory_$Pointer$.base_317|]} [2020-10-06 01:21:36,784 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,786 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,789 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,821 INFO L625 ElimStorePlain]: treesize reduction 66, result has 23.3 percent of original size [2020-10-06 01:21:36,822 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_317| vanished before elimination [2020-10-06 01:21:36,822 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-06 01:21:36,822 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:134, output treesize:20 [2020-10-06 01:21:36,870 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:36,870 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,877 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:36,878 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_116| vanished before elimination [2020-10-06 01:21:36,878 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-06 01:21:36,878 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2020-10-06 01:21:36,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:21:36,887 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_318|], 2=[|v_#memory_$Pointer$.base_319|]} [2020-10-06 01:21:36,889 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,891 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,894 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:36,930 INFO L625 ElimStorePlain]: treesize reduction 66, result has 23.3 percent of original size [2020-10-06 01:21:36,930 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_319| vanished before elimination [2020-10-06 01:21:36,931 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-06 01:21:36,931 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:134, output treesize:20 [2020-10-06 01:21:37,137 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [79155#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 79154#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 79157#(and (= pusherThread1of1ForFork0_~q~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 0) (= pusherThread1of1ForFork0_~q~0.base ULTIMATE.start_fifo_front_~self.base) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) 12)) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))))), 79156#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem25.base|))), 79159#(and (= |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) 12) |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem24.base|))), 79158#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) 12) (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (= |pusherThread1of1ForFork0_#in~q_.base| ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) |pusherThread1of1ForFork0_#in~q_.base|)) (not (= (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) ULTIMATE.start_fifo_front_~self.offset) 0)) (= |pusherThread1of1ForFork0_#in~q_.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))))] [2020-10-06 01:21:37,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-06 01:21:37,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-06 01:21:37,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-10-06 01:21:37,139 INFO L87 Difference]: Start difference. First operand 2032 states and 4614 transitions. Second operand 18 states. [2020-10-06 01:21:37,795 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 39 [2020-10-06 01:21:37,955 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 44 [2020-10-06 01:21:38,441 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2020-10-06 01:21:38,673 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 52 [2020-10-06 01:21:39,339 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 47 [2020-10-06 01:21:39,915 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 55 [2020-10-06 01:21:40,235 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 55 [2020-10-06 01:21:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:41,966 INFO L93 Difference]: Finished difference Result 2940 states and 6664 transitions. [2020-10-06 01:21:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-06 01:21:41,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2020-10-06 01:21:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:41,974 INFO L225 Difference]: With dead ends: 2940 [2020-10-06 01:21:41,974 INFO L226 Difference]: Without dead ends: 2940 [2020-10-06 01:21:41,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2020-10-06 01:21:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-10-06 01:21:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2022. [2020-10-06 01:21:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2020-10-06 01:21:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4578 transitions. [2020-10-06 01:21:42,017 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4578 transitions. Word has length 17 [2020-10-06 01:21:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:42,018 INFO L479 AbstractCegarLoop]: Abstraction has 2022 states and 4578 transitions. [2020-10-06 01:21:42,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-06 01:21:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4578 transitions. [2020-10-06 01:21:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 01:21:42,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:42,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:42,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 01:21:42,020 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:42,020 INFO L82 PathProgramCache]: Analyzing trace with hash -183833368, now seen corresponding path program 1 times [2020-10-06 01:21:42,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:42,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953963338] [2020-10-06 01:21:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:42,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953963338] [2020-10-06 01:21:42,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:42,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-06 01:21:42,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267827935] [2020-10-06 01:21:42,309 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:42,312 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:42,319 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-10-06 01:21:42,319 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:42,323 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_319|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_320|]} [2020-10-06 01:21:42,328 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:42,333 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:42,333 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-06 01:21:42,336 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:21:42,338 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:42,339 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-06 01:21:42,339 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:16 [2020-10-06 01:21:42,348 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_320|], 2=[|v_#memory_$Pointer$.base_321|]} [2020-10-06 01:21:42,352 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-10-06 01:21:42,352 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:42,356 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:42,356 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_320| vanished before elimination [2020-10-06 01:21:42,358 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-06 01:21:42,360 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:42,361 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-06 01:21:42,361 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:16 [2020-10-06 01:21:42,361 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:21:42,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-06 01:21:42,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-06 01:21:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-06 01:21:42,362 INFO L87 Difference]: Start difference. First operand 2022 states and 4578 transitions. Second operand 13 states. [2020-10-06 01:21:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:44,833 INFO L93 Difference]: Finished difference Result 2796 states and 6244 transitions. [2020-10-06 01:21:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-06 01:21:44,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-06 01:21:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:44,840 INFO L225 Difference]: With dead ends: 2796 [2020-10-06 01:21:44,840 INFO L226 Difference]: Without dead ends: 2796 [2020-10-06 01:21:44,841 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=768, Unknown=0, NotChecked=0, Total=1122 [2020-10-06 01:21:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2020-10-06 01:21:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2048. [2020-10-06 01:21:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2020-10-06 01:21:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 4636 transitions. [2020-10-06 01:21:44,880 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 4636 transitions. Word has length 18 [2020-10-06 01:21:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:44,881 INFO L479 AbstractCegarLoop]: Abstraction has 2048 states and 4636 transitions. [2020-10-06 01:21:44,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-06 01:21:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 4636 transitions. [2020-10-06 01:21:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 01:21:44,882 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:44,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:44,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-06 01:21:44,883 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:44,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1298599674, now seen corresponding path program 2 times [2020-10-06 01:21:44,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:44,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078198219] [2020-10-06 01:21:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:45,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078198219] [2020-10-06 01:21:45,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:45,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-06 01:21:45,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643256349] [2020-10-06 01:21:45,140 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:45,143 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:45,149 INFO L258 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-10-06 01:21:45,150 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:45,199 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:21:45,199 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,207 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:21:45,208 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,214 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,214 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_120| vanished before elimination [2020-10-06 01:21:45,214 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:45,214 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:34 [2020-10-06 01:21:45,277 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,277 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,282 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,282 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,290 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,290 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_121| vanished before elimination [2020-10-06 01:21:45,291 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-06 01:21:45,291 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:30 [2020-10-06 01:21:45,327 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-10-06 01:21:45,327 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,331 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-10-06 01:21:45,331 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,335 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2020-10-06 01:21:45,335 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,353 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_122| vanished before elimination [2020-10-06 01:21:45,353 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-06 01:21:45,354 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:91, output treesize:41 [2020-10-06 01:21:45,411 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,412 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,415 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,415 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,419 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,419 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,445 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,445 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_123| vanished before elimination [2020-10-06 01:21:45,445 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-06 01:21:45,446 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:149, output treesize:59 [2020-10-06 01:21:45,513 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:21:45,513 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,515 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,516 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:21:45,522 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,524 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,525 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,529 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2020-10-06 01:21:45,529 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,552 INFO L625 ElimStorePlain]: treesize reduction 26, result has 46.9 percent of original size [2020-10-06 01:21:45,553 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_124| vanished before elimination [2020-10-06 01:21:45,553 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:45,553 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:174, output treesize:23 [2020-10-06 01:21:45,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:21:45,616 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-06 01:21:45,617 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,622 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-06 01:21:45,623 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,641 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:45,641 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:16 [2020-10-06 01:21:45,687 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,687 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,692 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,692 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,694 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,694 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,696 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,696 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,703 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,703 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,712 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,712 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_125| vanished before elimination [2020-10-06 01:21:45,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:45,713 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:186, output treesize:13 [2020-10-06 01:21:45,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:21:45,756 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,757 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,760 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-06 01:21:45,761 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-06 01:21:45,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-06 01:21:45,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-06 01:21:45,771 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:16 [2020-10-06 01:21:45,862 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [93143#(and (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 93142#(and (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) ULTIMATE.start_fifo_front_~self.base)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0))), 93145#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) |ULTIMATE.start_main_~#q~1.base|)) (or (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)) (not (= |ULTIMATE.start_main_~#q~1.offset| (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 16))))), 93144#(and (not (or (and (= pusherThread1of1ForFork0_fifo_node_init_~self.base ULTIMATE.start_fifo_front_~self.base) (= (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 16) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) ULTIMATE.start_fifo_front_~self.base))), 93147#(and (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= |ULTIMATE.start_main_~#q~1.offset| pusherThread1of1ForFork0_fifo_node_init_~self.offset)) (or (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base 0)) (not (= |ULTIMATE.start_main_~#q~1.offset| pusherThread1of1ForFork0_fifo_node_init_~self.offset)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) |ULTIMATE.start_main_~#q~1.base|)) (or (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)) (not (= |ULTIMATE.start_main_~#q~1.offset| (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 16))))), 93146#(and (not (or (and (not (and (= pusherThread1of1ForFork0_fifo_node_init_~self.offset ULTIMATE.start_fifo_front_~self.offset) (= pusherThread1of1ForFork0_fifo_node_init_~self.base ULTIMATE.start_fifo_front_~self.base))) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (and (= pusherThread1of1ForFork0_fifo_node_init_~self.offset ULTIMATE.start_fifo_front_~self.offset) (= pusherThread1of1ForFork0_fifo_node_init_~self.base ULTIMATE.start_fifo_front_~self.base) (= pusherThread1of1ForFork0_fifo_node_init_~self.base 0)))) (or (not (= (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 16) ULTIMATE.start_fifo_front_~self.offset)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base ULTIMATE.start_fifo_front_~self.base))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) ULTIMATE.start_fifo_front_~self.base))), 93149#(and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (or (<= |#StackHeapBarrier| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.base 0))), 93148#(and (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) 0)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base ULTIMATE.start_fifo_front_~self.base))), 93151#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (or (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#q~1.base|) (= |ULTIMATE.start_main_~#q~1.base| 0))), 93150#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|))), 93152#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))] [2020-10-06 01:21:45,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-06 01:21:45,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-06 01:21:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2020-10-06 01:21:45,864 INFO L87 Difference]: Start difference. First operand 2048 states and 4636 transitions. Second operand 24 states. [2020-10-06 01:21:47,670 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2020-10-06 01:21:48,119 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2020-10-06 01:21:48,390 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2020-10-06 01:21:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:49,880 INFO L93 Difference]: Finished difference Result 2564 states and 5748 transitions. [2020-10-06 01:21:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-06 01:21:49,880 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 18 [2020-10-06 01:21:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:49,884 INFO L225 Difference]: With dead ends: 2564 [2020-10-06 01:21:49,884 INFO L226 Difference]: Without dead ends: 2564 [2020-10-06 01:21:49,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=414, Invalid=1226, Unknown=0, NotChecked=0, Total=1640 [2020-10-06 01:21:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2020-10-06 01:21:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2061. [2020-10-06 01:21:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2020-10-06 01:21:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 4668 transitions. [2020-10-06 01:21:49,916 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 4668 transitions. Word has length 18 [2020-10-06 01:21:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:49,917 INFO L479 AbstractCegarLoop]: Abstraction has 2061 states and 4668 transitions. [2020-10-06 01:21:49,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-06 01:21:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 4668 transitions. [2020-10-06 01:21:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-06 01:21:49,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:49,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:49,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-06 01:21:49,919 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1681614593, now seen corresponding path program 1 times [2020-10-06 01:21:49,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:49,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202253767] [2020-10-06 01:21:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:21:50,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202253767] [2020-10-06 01:21:50,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:21:50,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-06 01:21:50,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139788233] [2020-10-06 01:21:50,560 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:21:50,562 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:21:50,566 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-10-06 01:21:50,566 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:21:50,566 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:21:50,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-06 01:21:50,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:21:50,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-06 01:21:50,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-10-06 01:21:50,568 INFO L87 Difference]: Start difference. First operand 2061 states and 4668 transitions. Second operand 16 states. [2020-10-06 01:21:51,207 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-10-06 01:21:51,806 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2020-10-06 01:21:52,086 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2020-10-06 01:21:52,821 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 57 [2020-10-06 01:21:53,117 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-10-06 01:21:54,058 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2020-10-06 01:21:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:21:54,542 INFO L93 Difference]: Finished difference Result 3346 states and 7524 transitions. [2020-10-06 01:21:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-06 01:21:54,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2020-10-06 01:21:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:21:54,547 INFO L225 Difference]: With dead ends: 3346 [2020-10-06 01:21:54,547 INFO L226 Difference]: Without dead ends: 3346 [2020-10-06 01:21:54,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=232, Invalid=698, Unknown=0, NotChecked=0, Total=930 [2020-10-06 01:21:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2020-10-06 01:21:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2101. [2020-10-06 01:21:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2020-10-06 01:21:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4752 transitions. [2020-10-06 01:21:54,576 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4752 transitions. Word has length 18 [2020-10-06 01:21:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:21:54,576 INFO L479 AbstractCegarLoop]: Abstraction has 2101 states and 4752 transitions. [2020-10-06 01:21:54,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-06 01:21:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4752 transitions. [2020-10-06 01:21:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 01:21:54,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:21:54,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:21:54,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-06 01:21:54,578 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:21:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:21:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1830056629, now seen corresponding path program 1 times [2020-10-06 01:21:54,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:21:54,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111456580] [2020-10-06 01:21:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:21:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:21:54,656 ERROR L253 erpolLogProxyWrapper]: Interpolant 13 not inductive [2020-10-06 01:21:54,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-06 01:21:54,662 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-06 01:21:54,666 INFO L168 Benchmark]: Toolchain (without parser) took 78379.03 ms. Allocated memory was 141.0 MB in the beginning and 654.3 MB in the end (delta: 513.3 MB). Free memory was 100.3 MB in the beginning and 476.5 MB in the end (delta: -376.2 MB). Peak memory consumption was 137.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,666 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1021.30 ms. Allocated memory was 141.0 MB in the beginning and 208.1 MB in the end (delta: 67.1 MB). Free memory was 100.1 MB in the beginning and 135.7 MB in the end (delta: -35.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.59 ms. Allocated memory is still 208.1 MB. Free memory was 135.7 MB in the beginning and 131.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,667 INFO L168 Benchmark]: Boogie Preprocessor took 86.83 ms. Allocated memory is still 208.1 MB. Free memory was 131.8 MB in the beginning and 127.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,667 INFO L168 Benchmark]: RCFGBuilder took 932.52 ms. Allocated memory was 208.1 MB in the beginning and 233.8 MB in the end (delta: 25.7 MB). Free memory was 127.8 MB in the beginning and 147.3 MB in the end (delta: -19.5 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,668 INFO L168 Benchmark]: TraceAbstraction took 76253.49 ms. Allocated memory was 233.8 MB in the beginning and 654.3 MB in the end (delta: 420.5 MB). Free memory was 146.0 MB in the beginning and 476.5 MB in the end (delta: -330.6 MB). Peak memory consumption was 89.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:21:54,671 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1021.30 ms. Allocated memory was 141.0 MB in the beginning and 208.1 MB in the end (delta: 67.1 MB). Free memory was 100.1 MB in the beginning and 135.7 MB in the end (delta: -35.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.59 ms. Allocated memory is still 208.1 MB. Free memory was 135.7 MB in the beginning and 131.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 86.83 ms. Allocated memory is still 208.1 MB. Free memory was 131.8 MB in the beginning and 127.8 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 932.52 ms. Allocated memory was 208.1 MB in the beginning and 233.8 MB in the end (delta: 25.7 MB). Free memory was 127.8 MB in the beginning and 147.3 MB in the end (delta: -19.5 MB). Peak memory consumption was 38.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76253.49 ms. Allocated memory was 233.8 MB in the beginning and 654.3 MB in the end (delta: 420.5 MB). Free memory was 146.0 MB in the beginning and 476.5 MB in the end (delta: -330.6 MB). Peak memory consumption was 89.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 13.2s, 426 ProgramPointsBefore, 108 ProgramPointsAfterwards, 455 TransitionsBefore, 122 TransitionsAfterwards, 31742 CoEnabledTransitionPairs, 8 FixpointIterations, 119 TrivialSequentialCompositions, 217 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 63 ConcurrentYvCompositions, 15 ChoiceCompositions, 16803 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 73353 CheckedPairsTotal, 424 TotalNumberOfCompositions - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...