/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-15 10:28:56,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 10:28:56,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 10:28:57,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 10:28:57,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 10:28:57,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 10:28:57,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 10:28:57,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 10:28:57,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 10:28:57,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 10:28:57,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 10:28:57,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 10:28:57,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 10:28:57,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 10:28:57,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 10:28:57,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 10:28:57,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 10:28:57,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 10:28:57,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 10:28:57,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 10:28:57,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 10:28:57,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 10:28:57,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 10:28:57,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 10:28:57,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 10:28:57,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 10:28:57,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 10:28:57,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 10:28:57,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 10:28:57,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 10:28:57,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 10:28:57,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 10:28:57,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 10:28:57,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 10:28:57,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 10:28:57,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 10:28:57,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 10:28:57,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 10:28:57,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 10:28:57,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 10:28:57,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 10:28:57,048 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-15 10:28:57,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 10:28:57,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 10:28:57,076 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-15 10:28:57,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-15 10:28:57,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-15 10:28:57,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-15 10:28:57,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * Use SBE=true [2022-02-15 10:28:57,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 10:28:57,078 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 10:28:57,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:28:57,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-15 10:28:57,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-15 10:28:57,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 10:28:57,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-15 10:28:57,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-15 10:28:57,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 10:28:57,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-15 10:28:57,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 10:28:57,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 10:28:57,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 10:28:57,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 10:28:57,314 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 10:28:57,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2022-02-15 10:28:57,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2998a091/a319bfa814d6419897589829ff4c6783/FLAGf3f790182 [2022-02-15 10:28:57,802 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 10:28:57,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2022-02-15 10:28:57,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2998a091/a319bfa814d6419897589829ff4c6783/FLAGf3f790182 [2022-02-15 10:28:57,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2998a091/a319bfa814d6419897589829ff4c6783 [2022-02-15 10:28:57,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 10:28:57,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 10:28:57,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 10:28:57,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 10:28:57,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 10:28:57,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:28:57" (1/1) ... [2022-02-15 10:28:57,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68790fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:57, skipping insertion in model container [2022-02-15 10:28:57,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:28:57" (1/1) ... [2022-02-15 10:28:57,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 10:28:57,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 10:28:58,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-02-15 10:28:58,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:28:58,163 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 10:28:58,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2022-02-15 10:28:58,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 10:28:58,252 INFO L208 MainTranslator]: Completed translation [2022-02-15 10:28:58,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58 WrapperNode [2022-02-15 10:28:58,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 10:28:58,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-15 10:28:58,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-15 10:28:58,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-15 10:28:58,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,305 INFO L137 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-02-15 10:28:58,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-15 10:28:58,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 10:28:58,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 10:28:58,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 10:28:58,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 10:28:58,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 10:28:58,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 10:28:58,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 10:28:58,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (1/1) ... [2022-02-15 10:28:58,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 10:28:58,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:28:58,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 10:28:58,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 10:28:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-15 10:28:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-15 10:28:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-15 10:28:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-15 10:28:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 10:28:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 10:28:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 10:28:58,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 10:28:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-15 10:28:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 10:28:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 10:28:58,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 10:28:58,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 10:28:58,402 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-15 10:28:58,555 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 10:28:58,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 10:28:58,797 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 10:28:58,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 10:28:58,807 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-15 10:28:58,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:28:58 BoogieIcfgContainer [2022-02-15 10:28:58,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 10:28:58,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 10:28:58,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 10:28:58,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 10:28:58,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:28:57" (1/3) ... [2022-02-15 10:28:58,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5128a929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:28:58, skipping insertion in model container [2022-02-15 10:28:58,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:28:58" (2/3) ... [2022-02-15 10:28:58,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5128a929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:28:58, skipping insertion in model container [2022-02-15 10:28:58,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:28:58" (3/3) ... [2022-02-15 10:28:58,817 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-02-15 10:28:58,820 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-15 10:28:58,820 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-15 10:28:58,821 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-15 10:28:58,821 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-15 10:28:58,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,890 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,891 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,892 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,892 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,892 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,893 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,893 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,893 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,893 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,893 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,904 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,928 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,929 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-15 10:28:58,937 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-15 10:28:58,967 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 10:28:58,972 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 10:28:58,973 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-15 10:28:58,987 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 173 places, 176 transitions, 368 flow [2022-02-15 10:28:59,329 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:28:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:28:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-15 10:28:59,393 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:28:59,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:28:59,394 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:28:59,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:28:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash -211887483, now seen corresponding path program 1 times [2022-02-15 10:28:59,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:28:59,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094671996] [2022-02-15 10:28:59,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:28:59,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:28:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:28:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:28:59,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:28:59,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094671996] [2022-02-15 10:28:59,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094671996] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:28:59,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:28:59,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 10:28:59,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461455690] [2022-02-15 10:28:59,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:28:59,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 10:28:59,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:28:59,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 10:28:59,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 10:28:59,684 INFO L87 Difference]: Start difference. First operand has 11855 states, 11852 states have (on average 2.8596861289233884) internal successors, (33893), 11854 states have internal predecessors, (33893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:28:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:28:59,928 INFO L93 Difference]: Finished difference Result 15687 states and 43137 transitions. [2022-02-15 10:28:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 10:28:59,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-02-15 10:28:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:00,021 INFO L225 Difference]: With dead ends: 15687 [2022-02-15 10:29:00,021 INFO L226 Difference]: Without dead ends: 15411 [2022-02-15 10:29:00,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 10:29:00,028 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 80 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:00,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 10:29:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15411 states. [2022-02-15 10:29:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15411 to 14887. [2022-02-15 10:29:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14887 states, 14883 states have (on average 2.7668480817039574) internal successors, (41179), 14886 states have internal predecessors, (41179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14887 states to 14887 states and 41179 transitions. [2022-02-15 10:29:00,663 INFO L78 Accepts]: Start accepts. Automaton has 14887 states and 41179 transitions. Word has length 65 [2022-02-15 10:29:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:00,665 INFO L470 AbstractCegarLoop]: Abstraction has 14887 states and 41179 transitions. [2022-02-15 10:29:00,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 14887 states and 41179 transitions. [2022-02-15 10:29:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-15 10:29:00,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:00,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:00,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 10:29:00,674 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2060462298, now seen corresponding path program 1 times [2022-02-15 10:29:00,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:00,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887584530] [2022-02-15 10:29:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:00,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:00,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:00,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887584530] [2022-02-15 10:29:00,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887584530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:29:00,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:29:00,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 10:29:00,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601101845] [2022-02-15 10:29:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:00,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 10:29:00,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 10:29:00,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 10:29:00,806 INFO L87 Difference]: Start difference. First operand 14887 states and 41179 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:00,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:00,982 INFO L93 Difference]: Finished difference Result 22347 states and 61714 transitions. [2022-02-15 10:29:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 10:29:00,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-15 10:29:00,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:01,067 INFO L225 Difference]: With dead ends: 22347 [2022-02-15 10:29:01,067 INFO L226 Difference]: Without dead ends: 22347 [2022-02-15 10:29:01,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-15 10:29:01,069 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 146 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:01,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 642 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 10:29:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22347 states. [2022-02-15 10:29:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22347 to 16015. [2022-02-15 10:29:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16015 states, 16011 states have (on average 2.7665355068390483) internal successors, (44295), 16014 states have internal predecessors, (44295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16015 states to 16015 states and 44295 transitions. [2022-02-15 10:29:01,796 INFO L78 Accepts]: Start accepts. Automaton has 16015 states and 44295 transitions. Word has length 81 [2022-02-15 10:29:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:01,797 INFO L470 AbstractCegarLoop]: Abstraction has 16015 states and 44295 transitions. [2022-02-15 10:29:01,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 16015 states and 44295 transitions. [2022-02-15 10:29:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-15 10:29:01,808 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:01,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:01,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 10:29:01,810 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash 235148469, now seen corresponding path program 1 times [2022-02-15 10:29:01,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:01,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886052265] [2022-02-15 10:29:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:01,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:01,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:01,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886052265] [2022-02-15 10:29:01,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886052265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:29:01,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:29:01,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 10:29:01,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149661592] [2022-02-15 10:29:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:01,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 10:29:01,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:01,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 10:29:01,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 10:29:01,957 INFO L87 Difference]: Start difference. First operand 16015 states and 44295 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:02,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:02,151 INFO L93 Difference]: Finished difference Result 24457 states and 67330 transitions. [2022-02-15 10:29:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 10:29:02,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-02-15 10:29:02,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:02,225 INFO L225 Difference]: With dead ends: 24457 [2022-02-15 10:29:02,226 INFO L226 Difference]: Without dead ends: 24457 [2022-02-15 10:29:02,228 INFO L932 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 [2022-02-15 10:29:02,231 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 103 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:02,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 377 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 10:29:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24457 states. [2022-02-15 10:29:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24457 to 22373. [2022-02-15 10:29:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22373 states, 22369 states have (on average 2.7695471411328176) internal successors, (61952), 22372 states have internal predecessors, (61952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22373 states to 22373 states and 61952 transitions. [2022-02-15 10:29:02,984 INFO L78 Accepts]: Start accepts. Automaton has 22373 states and 61952 transitions. Word has length 99 [2022-02-15 10:29:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:02,985 INFO L470 AbstractCegarLoop]: Abstraction has 22373 states and 61952 transitions. [2022-02-15 10:29:02,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22373 states and 61952 transitions. [2022-02-15 10:29:03,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-15 10:29:03,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:03,005 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:03,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 10:29:03,006 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:03,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 172146190, now seen corresponding path program 1 times [2022-02-15 10:29:03,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:03,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331039736] [2022-02-15 10:29:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:03,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:03,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:03,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331039736] [2022-02-15 10:29:03,137 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331039736] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:29:03,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67742451] [2022-02-15 10:29:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:03,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:29:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:29:03,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:29:03,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-15 10:29:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:03,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-15 10:29:03,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:29:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:03,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:29:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:03,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67742451] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 10:29:03,787 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 10:29:03,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-15 10:29:03,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341282054] [2022-02-15 10:29:03,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 10:29:03,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 10:29:03,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 10:29:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-15 10:29:03,789 INFO L87 Difference]: Start difference. First operand 22373 states and 61952 transitions. Second operand has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:04,244 INFO L93 Difference]: Finished difference Result 43271 states and 119230 transitions. [2022-02-15 10:29:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 10:29:04,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-02-15 10:29:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:04,367 INFO L225 Difference]: With dead ends: 43271 [2022-02-15 10:29:04,367 INFO L226 Difference]: Without dead ends: 43119 [2022-02-15 10:29:04,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-02-15 10:29:04,368 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 979 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:04,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 1276 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:29:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43119 states. [2022-02-15 10:29:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43119 to 35319. [2022-02-15 10:29:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35319 states, 35315 states have (on average 2.7909103780263345) internal successors, (98561), 35318 states have internal predecessors, (98561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35319 states to 35319 states and 98561 transitions. [2022-02-15 10:29:05,252 INFO L78 Accepts]: Start accepts. Automaton has 35319 states and 98561 transitions. Word has length 110 [2022-02-15 10:29:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:05,252 INFO L470 AbstractCegarLoop]: Abstraction has 35319 states and 98561 transitions. [2022-02-15 10:29:05,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.2) internal successors, (262), 10 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35319 states and 98561 transitions. [2022-02-15 10:29:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-15 10:29:05,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:05,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:05,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-15 10:29:05,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:29:05,486 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:05,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash -154454040, now seen corresponding path program 1 times [2022-02-15 10:29:05,487 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:05,487 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836554416] [2022-02-15 10:29:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:05,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:05,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:05,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836554416] [2022-02-15 10:29:05,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836554416] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:29:05,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:29:05,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-15 10:29:05,538 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131475807] [2022-02-15 10:29:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:05,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-15 10:29:05,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-15 10:29:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-15 10:29:05,539 INFO L87 Difference]: Start difference. First operand 35319 states and 98561 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:05,597 INFO L93 Difference]: Finished difference Result 11357 states and 29882 transitions. [2022-02-15 10:29:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-15 10:29:05,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-02-15 10:29:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:05,621 INFO L225 Difference]: With dead ends: 11357 [2022-02-15 10:29:05,621 INFO L226 Difference]: Without dead ends: 11319 [2022-02-15 10:29:05,621 INFO L932 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 [2022-02-15 10:29:05,622 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 78 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:05,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 238 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 10:29:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11319 states. [2022-02-15 10:29:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11319 to 9775. [2022-02-15 10:29:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9775 states, 9771 states have (on average 2.607102650701054) internal successors, (25474), 9774 states have internal predecessors, (25474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9775 states to 9775 states and 25474 transitions. [2022-02-15 10:29:05,999 INFO L78 Accepts]: Start accepts. Automaton has 9775 states and 25474 transitions. Word has length 113 [2022-02-15 10:29:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:05,999 INFO L470 AbstractCegarLoop]: Abstraction has 9775 states and 25474 transitions. [2022-02-15 10:29:05,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9775 states and 25474 transitions. [2022-02-15 10:29:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-15 10:29:06,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:06,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:06,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 10:29:06,009 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1480826348, now seen corresponding path program 1 times [2022-02-15 10:29:06,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:06,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44963658] [2022-02-15 10:29:06,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:06,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:06,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:06,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44963658] [2022-02-15 10:29:06,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44963658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:29:06,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:29:06,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-02-15 10:29:06,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708616737] [2022-02-15 10:29:06,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:06,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-15 10:29:06,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:06,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-15 10:29:06,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-02-15 10:29:06,721 INFO L87 Difference]: Start difference. First operand 9775 states and 25474 transitions. Second operand has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:09,361 INFO L93 Difference]: Finished difference Result 24261 states and 63753 transitions. [2022-02-15 10:29:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-15 10:29:09,361 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-02-15 10:29:09,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:09,406 INFO L225 Difference]: With dead ends: 24261 [2022-02-15 10:29:09,406 INFO L226 Difference]: Without dead ends: 23418 [2022-02-15 10:29:09,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=577, Invalid=2963, Unknown=0, NotChecked=0, Total=3540 [2022-02-15 10:29:09,408 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 1255 mSDsluCounter, 7904 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 8264 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:09,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1255 Valid, 8264 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 10:29:09,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23418 states. [2022-02-15 10:29:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23418 to 12562. [2022-02-15 10:29:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12562 states, 12558 states have (on average 2.6335403726708075) internal successors, (33072), 12561 states have internal predecessors, (33072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 33072 transitions. [2022-02-15 10:29:09,701 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 33072 transitions. Word has length 122 [2022-02-15 10:29:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:09,701 INFO L470 AbstractCegarLoop]: Abstraction has 12562 states and 33072 transitions. [2022-02-15 10:29:09,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.083333333333333) internal successors, (122), 24 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 33072 transitions. [2022-02-15 10:29:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-15 10:29:09,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:09,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:09,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 10:29:09,714 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1207381166, now seen corresponding path program 2 times [2022-02-15 10:29:09,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:09,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034787091] [2022-02-15 10:29:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:09,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:10,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:10,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034787091] [2022-02-15 10:29:10,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034787091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:29:10,432 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:29:10,432 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:29:10,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655064844] [2022-02-15 10:29:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:10,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:29:10,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:29:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:29:10,434 INFO L87 Difference]: Start difference. First operand 12562 states and 33072 transitions. Second operand has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:12,443 INFO L93 Difference]: Finished difference Result 27373 states and 72376 transitions. [2022-02-15 10:29:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-15 10:29:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-02-15 10:29:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:12,495 INFO L225 Difference]: With dead ends: 27373 [2022-02-15 10:29:12,495 INFO L226 Difference]: Without dead ends: 26740 [2022-02-15 10:29:12,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=2456, Unknown=0, NotChecked=0, Total=2862 [2022-02-15 10:29:12,497 INFO L933 BasicCegarLoop]: 431 mSDtfsCounter, 1099 mSDsluCounter, 7160 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 7350 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:12,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1099 Valid, 7350 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 10:29:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26740 states. [2022-02-15 10:29:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26740 to 13596. [2022-02-15 10:29:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13596 states, 13592 states have (on average 2.635741612713361) internal successors, (35825), 13595 states have internal predecessors, (35825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13596 states to 13596 states and 35825 transitions. [2022-02-15 10:29:12,772 INFO L78 Accepts]: Start accepts. Automaton has 13596 states and 35825 transitions. Word has length 122 [2022-02-15 10:29:12,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:12,772 INFO L470 AbstractCegarLoop]: Abstraction has 13596 states and 35825 transitions. [2022-02-15 10:29:12,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 13596 states and 35825 transitions. [2022-02-15 10:29:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-02-15 10:29:12,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:12,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:12,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 10:29:12,785 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:12,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash -959008282, now seen corresponding path program 3 times [2022-02-15 10:29:12,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:12,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432667605] [2022-02-15 10:29:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:12,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:13,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:13,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432667605] [2022-02-15 10:29:13,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432667605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 10:29:13,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 10:29:13,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 10:29:13,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847577845] [2022-02-15 10:29:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:13,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 10:29:13,677 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 10:29:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-02-15 10:29:13,678 INFO L87 Difference]: Start difference. First operand 13596 states and 35825 transitions. Second operand has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:16,361 INFO L93 Difference]: Finished difference Result 29271 states and 77079 transitions. [2022-02-15 10:29:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-02-15 10:29:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-02-15 10:29:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:16,420 INFO L225 Difference]: With dead ends: 29271 [2022-02-15 10:29:16,420 INFO L226 Difference]: Without dead ends: 28458 [2022-02-15 10:29:16,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=628, Invalid=3662, Unknown=0, NotChecked=0, Total=4290 [2022-02-15 10:29:16,421 INFO L933 BasicCegarLoop]: 584 mSDtfsCounter, 1626 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1626 SdHoareTripleChecker+Valid, 8627 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:16,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1626 Valid, 8627 Invalid, 2285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-15 10:29:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28458 states. [2022-02-15 10:29:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28458 to 12315. [2022-02-15 10:29:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12315 states, 12311 states have (on average 2.630899195841118) internal successors, (32389), 12314 states have internal predecessors, (32389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12315 states to 12315 states and 32389 transitions. [2022-02-15 10:29:16,772 INFO L78 Accepts]: Start accepts. Automaton has 12315 states and 32389 transitions. Word has length 122 [2022-02-15 10:29:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:16,772 INFO L470 AbstractCegarLoop]: Abstraction has 12315 states and 32389 transitions. [2022-02-15 10:29:16,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.357142857142857) internal successors, (122), 28 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12315 states and 32389 transitions. [2022-02-15 10:29:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-15 10:29:16,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:16,789 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:16,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 10:29:16,789 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:16,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1813794985, now seen corresponding path program 1 times [2022-02-15 10:29:16,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:16,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140917015] [2022-02-15 10:29:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:16,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:17,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:17,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140917015] [2022-02-15 10:29:17,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140917015] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:29:17,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166898901] [2022-02-15 10:29:17,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:17,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:29:17,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:29:17,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:29:17,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-15 10:29:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:17,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-15 10:29:17,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:29:18,826 INFO L387 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 19 treesize of output 15 [2022-02-15 10:29:19,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-02-15 10:29:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:19,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:29:20,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-02-15 10:29:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-15 10:29:21,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166898901] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 10:29:21,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 10:29:21,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26, 26] total 68 [2022-02-15 10:29:21,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749450527] [2022-02-15 10:29:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 10:29:21,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-15 10:29:21,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-15 10:29:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4313, Unknown=0, NotChecked=0, Total=4556 [2022-02-15 10:29:21,127 INFO L87 Difference]: Start difference. First operand 12315 states and 32389 transitions. Second operand has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:29:25,684 INFO L93 Difference]: Finished difference Result 32068 states and 84922 transitions. [2022-02-15 10:29:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-15 10:29:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-02-15 10:29:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:29:25,749 INFO L225 Difference]: With dead ends: 32068 [2022-02-15 10:29:25,749 INFO L226 Difference]: Without dead ends: 32068 [2022-02-15 10:29:25,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4864 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1534, Invalid=14978, Unknown=0, NotChecked=0, Total=16512 [2022-02-15 10:29:25,754 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 2051 mSDsluCounter, 8776 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 9207 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-15 10:29:25,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2051 Valid, 9207 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-15 10:29:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32068 states. [2022-02-15 10:29:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32068 to 15273. [2022-02-15 10:29:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15273 states, 15269 states have (on average 2.6509922064313316) internal successors, (40478), 15272 states have internal predecessors, (40478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15273 states to 15273 states and 40478 transitions. [2022-02-15 10:29:26,179 INFO L78 Accepts]: Start accepts. Automaton has 15273 states and 40478 transitions. Word has length 164 [2022-02-15 10:29:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:29:26,180 INFO L470 AbstractCegarLoop]: Abstraction has 15273 states and 40478 transitions. [2022-02-15 10:29:26,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.181818181818182) internal successors, (158), 22 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:29:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15273 states and 40478 transitions. [2022-02-15 10:29:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-02-15 10:29:26,198 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:29:26,199 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:29:26,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-15 10:29:26,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-15 10:29:26,413 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:29:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:29:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1474217689, now seen corresponding path program 2 times [2022-02-15 10:29:26,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:29:26,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384413949] [2022-02-15 10:29:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:29:26,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:29:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:29:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:29:27,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:29:27,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384413949] [2022-02-15 10:29:27,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384413949] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:29:27,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686669179] [2022-02-15 10:29:27,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 10:29:27,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:29:27,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:29:27,281 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:29:27,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-15 10:29:27,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-15 10:29:27,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 10:29:27,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-15 10:29:27,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:29:27,512 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 10:29:27,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 10:29:27,525 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 10:29:27,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 10:29:28,383 INFO L387 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 19 treesize of output 15 [2022-02-15 10:29:28,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 54 [2022-02-15 10:29:29,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-02-15 10:29:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-15 10:29:29,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:29:30,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_244 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_244) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-02-15 10:29:30,092 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:29:30,092 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-02-15 10:29:30,101 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:29:30,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-02-15 10:29:30,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-02-15 10:29:31,143 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-15 10:29:31,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-15 10:29:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-15 10:29:31,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686669179] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 10:29:31,154 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 10:29:31,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 75 [2022-02-15 10:29:31,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041143520] [2022-02-15 10:29:31,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 10:29:31,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-02-15 10:29:31,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:29:31,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-02-15 10:29:31,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=5124, Unknown=1, NotChecked=144, Total=5550 [2022-02-15 10:29:31,156 INFO L87 Difference]: Start difference. First operand 15273 states and 40478 transitions. Second operand has 75 states, 75 states have (on average 6.026666666666666) internal successors, (452), 75 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:30:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:30:23,051 INFO L93 Difference]: Finished difference Result 63541 states and 163172 transitions. [2022-02-15 10:30:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2022-02-15 10:30:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 6.026666666666666) internal successors, (452), 75 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2022-02-15 10:30:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:30:23,184 INFO L225 Difference]: With dead ends: 63541 [2022-02-15 10:30:23,185 INFO L226 Difference]: Without dead ends: 63541 [2022-02-15 10:30:23,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 311 SyntacticMatches, 7 SemanticMatches, 314 ConstructedPredicates, 1 IntricatePredicates, 8 DeprecatedPredicates, 34087 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=13400, Invalid=85497, Unknown=17, NotChecked=626, Total=99540 [2022-02-15 10:30:23,193 INFO L933 BasicCegarLoop]: 1002 mSDtfsCounter, 15707 mSDsluCounter, 33665 mSDsCounter, 0 mSdLazyCounter, 9115 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15707 SdHoareTripleChecker+Valid, 33759 SdHoareTripleChecker+Invalid, 11193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 9115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1476 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-15 10:30:23,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15707 Valid, 33759 Invalid, 11193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [602 Valid, 9115 Invalid, 0 Unknown, 1476 Unchecked, 5.9s Time] [2022-02-15 10:30:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63541 states. [2022-02-15 10:30:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63541 to 16534. [2022-02-15 10:30:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16534 states, 16530 states have (on average 2.6630973986690867) internal successors, (44021), 16533 states have internal predecessors, (44021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:30:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 44021 transitions. [2022-02-15 10:30:23,718 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 44021 transitions. Word has length 164 [2022-02-15 10:30:23,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:30:23,718 INFO L470 AbstractCegarLoop]: Abstraction has 16534 states and 44021 transitions. [2022-02-15 10:30:23,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 6.026666666666666) internal successors, (452), 75 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:30:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 44021 transitions. [2022-02-15 10:30:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-02-15 10:30:23,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:30:23,737 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:30:23,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-15 10:30:23,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:30:23,946 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:30:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:30:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1324549368, now seen corresponding path program 2 times [2022-02-15 10:30:23,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:30:23,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310118637] [2022-02-15 10:30:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:30:23,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:30:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:30:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:30:24,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:30:24,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310118637] [2022-02-15 10:30:24,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310118637] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:30:24,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918746377] [2022-02-15 10:30:24,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 10:30:24,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:30:24,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:30:24,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:30:24,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-15 10:30:24,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 10:30:24,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 10:30:24,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-15 10:30:24,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:30:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:30:24,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:30:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:30:24,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918746377] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 10:30:24,724 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 10:30:24,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-15 10:30:24,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507522123] [2022-02-15 10:30:24,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 10:30:24,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-15 10:30:24,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:30:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-15 10:30:24,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-02-15 10:30:24,725 INFO L87 Difference]: Start difference. First operand 16534 states and 44021 transitions. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:30:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:30:24,942 INFO L93 Difference]: Finished difference Result 26311 states and 69356 transitions. [2022-02-15 10:30:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-15 10:30:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-02-15 10:30:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:30:24,993 INFO L225 Difference]: With dead ends: 26311 [2022-02-15 10:30:24,993 INFO L226 Difference]: Without dead ends: 26311 [2022-02-15 10:30:24,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2022-02-15 10:30:24,994 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 675 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 10:30:24,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 1486 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 10:30:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2022-02-15 10:30:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 21574. [2022-02-15 10:30:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21574 states, 21570 states have (on average 2.6575336114974504) internal successors, (57323), 21573 states have internal predecessors, (57323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:30:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21574 states to 21574 states and 57323 transitions. [2022-02-15 10:30:25,357 INFO L78 Accepts]: Start accepts. Automaton has 21574 states and 57323 transitions. Word has length 194 [2022-02-15 10:30:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:30:25,358 INFO L470 AbstractCegarLoop]: Abstraction has 21574 states and 57323 transitions. [2022-02-15 10:30:25,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:30:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21574 states and 57323 transitions. [2022-02-15 10:30:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-02-15 10:30:25,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:30:25,379 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:30:25,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-15 10:30:25,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:30:25,596 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:30:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:30:25,596 INFO L85 PathProgramCache]: Analyzing trace with hash 893496526, now seen corresponding path program 1 times [2022-02-15 10:30:25,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:30:25,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682824783] [2022-02-15 10:30:25,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:30:25,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:30:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:30:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:30:26,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:30:26,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682824783] [2022-02-15 10:30:26,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682824783] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:30:26,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770829719] [2022-02-15 10:30:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:30:26,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:30:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:30:26,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:30:26,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-15 10:30:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:30:26,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 86 conjunts are in the unsatisfiable core [2022-02-15 10:30:26,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:30:27,763 INFO L387 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 19 treesize of output 15 [2022-02-15 10:30:28,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 10:30:28,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 51 treesize of output 38 [2022-02-15 10:30:30,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-02-15 10:30:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 5 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:30:30,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:30:56,234 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:30:56,235 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-02-15 10:30:56,242 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:30:56,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-02-15 10:30:56,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2022-02-15 10:30:56,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:30:56,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-02-15 10:30:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:30:57,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770829719] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 10:30:57,279 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 10:30:57,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 33] total 92 [2022-02-15 10:30:57,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547777062] [2022-02-15 10:30:57,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 10:30:57,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-02-15 10:30:57,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:30:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-02-15 10:30:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=7654, Unknown=21, NotChecked=0, Total=8372 [2022-02-15 10:30:57,281 INFO L87 Difference]: Start difference. First operand 21574 states and 57323 transitions. Second operand has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:32:05,848 WARN L228 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:33:11,378 WARN L228 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:33:29,799 WARN L228 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:35:52,255 WARN L228 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:35:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:35:52,781 INFO L93 Difference]: Finished difference Result 82280 states and 216218 transitions. [2022-02-15 10:35:52,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-02-15 10:35:52,781 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-02-15 10:35:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:35:52,931 INFO L225 Difference]: With dead ends: 82280 [2022-02-15 10:35:52,931 INFO L226 Difference]: Without dead ends: 81566 [2022-02-15 10:35:52,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 340 SyntacticMatches, 22 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25621 ImplicationChecksByTransitivity, 317.4s TimeCoverageRelationStatistics Valid=6030, Invalid=58611, Unknown=129, NotChecked=0, Total=64770 [2022-02-15 10:35:52,934 INFO L933 BasicCegarLoop]: 1035 mSDtfsCounter, 5601 mSDsluCounter, 36320 mSDsCounter, 0 mSdLazyCounter, 7316 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5601 SdHoareTripleChecker+Valid, 35972 SdHoareTripleChecker+Invalid, 11749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 7316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4324 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-15 10:35:52,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5601 Valid, 35972 Invalid, 11749 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [109 Valid, 7316 Invalid, 0 Unknown, 4324 Unchecked, 3.7s Time] [2022-02-15 10:35:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81566 states. [2022-02-15 10:35:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81566 to 43229. [2022-02-15 10:35:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43229 states, 43225 states have (on average 2.7627993059572007) internal successors, (119422), 43228 states have internal predecessors, (119422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:35:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43229 states to 43229 states and 119422 transitions. [2022-02-15 10:35:54,005 INFO L78 Accepts]: Start accepts. Automaton has 43229 states and 119422 transitions. Word has length 199 [2022-02-15 10:35:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:35:54,005 INFO L470 AbstractCegarLoop]: Abstraction has 43229 states and 119422 transitions. [2022-02-15 10:35:54,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 6.195652173913044) internal successors, (570), 92 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:35:54,005 INFO L276 IsEmpty]: Start isEmpty. Operand 43229 states and 119422 transitions. [2022-02-15 10:35:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-02-15 10:35:54,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:35:54,036 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:35:54,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-15 10:35:54,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-15 10:35:54,238 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:35:54,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:35:54,238 INFO L85 PathProgramCache]: Analyzing trace with hash 63873104, now seen corresponding path program 2 times [2022-02-15 10:35:54,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:35:54,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013435754] [2022-02-15 10:35:54,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:35:54,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:35:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:35:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:35:55,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:35:55,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013435754] [2022-02-15 10:35:55,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013435754] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:35:55,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942598955] [2022-02-15 10:35:55,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-15 10:35:55,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:35:55,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:35:55,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:35:55,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-15 10:35:55,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-15 10:35:55,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 10:35:55,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 89 conjunts are in the unsatisfiable core [2022-02-15 10:35:55,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:35:55,644 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 10:35:55,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 10:35:55,657 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 10:35:55,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 10:35:56,356 INFO L387 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 13 treesize of output 9 [2022-02-15 10:35:56,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 25 [2022-02-15 10:35:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 10:35:57,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2022-02-15 10:35:58,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-15 10:35:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:35:58,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:36:01,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_422 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))) is different from false [2022-02-15 10:36:01,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-02-15 10:36:02,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) is different from false [2022-02-15 10:36:13,897 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_420) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-02-15 10:36:13,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:36:13,902 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-02-15 10:36:13,908 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:36:13,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-02-15 10:36:13,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-02-15 10:36:14,667 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-15 10:36:14,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-15 10:36:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-02-15 10:36:14,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942598955] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 10:36:14,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 10:36:14,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 33] total 93 [2022-02-15 10:36:14,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881902970] [2022-02-15 10:36:14,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 10:36:14,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-02-15 10:36:14,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:36:14,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-02-15 10:36:14,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=7447, Unknown=4, NotChecked=708, Total=8556 [2022-02-15 10:36:14,715 INFO L87 Difference]: Start difference. First operand 43229 states and 119422 transitions. Second operand has 93 states, 93 states have (on average 5.709677419354839) internal successors, (531), 93 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:36:17,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse4 (+ |c_~#arr~0.offset| .cse0)) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 4 .cse0) (<= 0 .cse1) (<= .cse2 4) (<= .cse3 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ (- 1) c_~top~0) 0) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (<= 0 .cse3) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse1 4) (not (= (select |c_#valid| |c_~#arr~0.base|) 0))))) is different from false [2022-02-15 10:36:18,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse0 (* c_~top~0 4)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 4 .cse0) (<= 0 .cse1) (<= .cse2 4) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (= (+ (- 1) c_~top~0) 0) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse1 4))) is different from false [2022-02-15 10:36:18,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= 4 .cse0) (<= .cse1 4) (<= .cse2 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (= (+ (- 1) c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 .cse2) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|))) is different from false [2022-02-15 10:36:19,529 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= 4 .cse0) (<= .cse1 4) (<= .cse2 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (= (+ (- 1) c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 .cse2) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|))) is different from false [2022-02-15 10:36:21,904 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) (<= 4 .cse1) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) (+ |c_~#arr~0.offset| (* c_~top~0 4))) (<= .cse2 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 .cse0) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (= (+ (- 1) c_~top~0) 0) (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 .cse2) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_422 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|)))))) is different from false [2022-02-15 10:36:26,257 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse3 0)) (.cse2 (+ |c_~#arr~0.offset| .cse1))) (and (<= .cse0 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) .cse2) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse2) (= (+ (- 1) c_~top~0) 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|)))) is different from false [2022-02-15 10:36:47,274 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) is different from false [2022-02-15 10:37:34,103 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) is different from false [2022-02-15 10:37:37,061 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) is different from false [2022-02-15 10:37:43,894 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| .cse1))) (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) .cse0) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int)) (or (forall ((v_ArrVal_422 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_47|))))))) is different from false [2022-02-15 10:38:40,158 WARN L228 SmtUtils]: Spent 14.01s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:39:28,604 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse5 (+ |c_~#arr~0.offset| .cse1)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| 5) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= .cse0 4) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (<= 4 .cse1) (<= 0 .cse2) (<= .cse3 4) (<= .cse4 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ (- 1) c_~top~0) 0) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t2Thread1of1ForFork1_get_top_#res#1| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 .cse4) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (= 0 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse2 4) (not (= (select |c_#valid| |c_~#arr~0.base|) 0)) (<= 0 .cse0)))) is different from false [2022-02-15 10:39:29,349 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse3 (select .cse6 0)) (.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse5 (+ |c_~#arr~0.offset| .cse1)) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (not (= 4294967294 (mod (select .cse0 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 4 .cse1) (<= 0 .cse2) (<= .cse3 4) (<= .cse4 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ (- 1) c_~top~0) 0) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (not (= (- 2) |c_t2Thread1of1ForFork1_pop_#res#1|)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (<= 0 .cse4) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse6 .cse5) 4294967296))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse2 4)))) is different from false [2022-02-15 10:39:36,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse4 (+ |c_~#arr~0.offset| .cse0)) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 4 .cse0) (<= 0 .cse1) (<= .cse2 4) (<= .cse3 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ (- 1) c_~top~0) 0) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (<= 0 .cse3) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse1 4)))) is different from false [2022-02-15 10:39:37,192 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))))) is different from false [2022-02-15 10:39:38,257 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse0))) (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|))))) is different from false [2022-02-15 10:39:44,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse0))) (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|)))) is different from false [2022-02-15 10:40:31,139 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|)) (.cse1 (* c_~top~0 4))) (and (not (= 4294967294 (mod (select .cse0 (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) (not (= (- 2) |c_t2Thread1of1ForFork1_pop_#res#1|)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ .cse1 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) is different from false [2022-02-15 10:40:31,916 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse0))) (and (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1) (not (= (- 2) |c_t2Thread1of1ForFork1_pop_#res#1|)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|))))) is different from false [2022-02-15 10:40:37,248 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse5 (+ |c_~#arr~0.offset| .cse1)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse0 (select (select |c_#memory_int| 5) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= .cse0 4) (< |c_t2Thread1of1ForFork1_pop_#res#1| 4294967296) (<= 4 .cse1) (<= 0 .cse2) (<= .cse3 4) (<= .cse4 4) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ (- 1) c_~top~0) 0) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse5) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t2Thread1of1ForFork1_get_top_#res#1| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= 5 |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (<= 0 |c_t2Thread1of1ForFork1_pop_#res#1|) (<= 0 .cse4) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (= 0 |c_t2Thread1of1ForFork1_pop_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (div |c_t2Thread1of1ForFork1_pop_#res#1| (- 4294967296)) (div (+ (* (- 1) |c_t2Thread1of1ForFork1_pop_#res#1|) 4) 4294967296)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse2 4) (<= 0 .cse0)))) is different from false [2022-02-15 10:40:39,176 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse0))) (and (not (= 4294967294 (mod (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_pop_~stack#1.base|) (+ (* |c_t2Thread1of1ForFork1_get_top_#res#1| 4) |c_t2Thread1of1ForFork1_pop_~stack#1.offset|)) 4294967296))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1) (not (= (- 2) |c_t2Thread1of1ForFork1_pop_#res#1|)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_47| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_35| Int) (v_ArrVal_422 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_47| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|) v_ArrVal_422)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_35|)))) (not (= (mod (+ |c_t1Thread1of1ForFork0_push_~x#1| 2) 4294967296) 0)) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)) (= 5 |c_~#arr~0.base|)))) is different from false [2022-02-15 10:40:42,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 10:40:42,861 INFO L93 Difference]: Finished difference Result 293908 states and 799200 transitions. [2022-02-15 10:40:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 391 states. [2022-02-15 10:40:42,862 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 5.709677419354839) internal successors, (531), 93 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-02-15 10:40:42,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 10:40:43,845 INFO L225 Difference]: With dead ends: 293908 [2022-02-15 10:40:43,845 INFO L226 Difference]: Without dead ends: 288004 [2022-02-15 10:40:43,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 338 SyntacticMatches, 12 SemanticMatches, 469 ConstructedPredicates, 24 IntricatePredicates, 4 DeprecatedPredicates, 81673 ImplicationChecksByTransitivity, 274.3s TimeCoverageRelationStatistics Valid=13507, Invalid=185679, Unknown=272, NotChecked=21912, Total=221370 [2022-02-15 10:40:43,854 INFO L933 BasicCegarLoop]: 1205 mSDtfsCounter, 9684 mSDsluCounter, 54508 mSDsCounter, 0 mSdLazyCounter, 14363 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9684 SdHoareTripleChecker+Valid, 53184 SdHoareTripleChecker+Invalid, 22746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 14363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8031 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-02-15 10:40:43,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9684 Valid, 53184 Invalid, 22746 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [352 Valid, 14363 Invalid, 0 Unknown, 8031 Unchecked, 7.3s Time] [2022-02-15 10:40:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288004 states. [2022-02-15 10:40:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288004 to 112367. [2022-02-15 10:40:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112367 states, 112363 states have (on average 2.7965077472121607) internal successors, (314224), 112366 states have internal predecessors, (314224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:40:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112367 states to 112367 states and 314224 transitions. [2022-02-15 10:40:49,303 INFO L78 Accepts]: Start accepts. Automaton has 112367 states and 314224 transitions. Word has length 199 [2022-02-15 10:40:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 10:40:49,303 INFO L470 AbstractCegarLoop]: Abstraction has 112367 states and 314224 transitions. [2022-02-15 10:40:49,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 93 states have (on average 5.709677419354839) internal successors, (531), 93 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:40:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 112367 states and 314224 transitions. [2022-02-15 10:40:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-02-15 10:40:49,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 10:40:49,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 10:40:49,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-15 10:40:49,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:40:49,571 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-15 10:40:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 10:40:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1502720164, now seen corresponding path program 3 times [2022-02-15 10:40:49,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 10:40:49,571 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86430813] [2022-02-15 10:40:49,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 10:40:49,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 10:40:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 10:40:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:40:50,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 10:40:50,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86430813] [2022-02-15 10:40:50,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86430813] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 10:40:50,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010415718] [2022-02-15 10:40:50,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-15 10:40:50,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:40:50,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 10:40:50,757 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 10:40:50,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-15 10:40:50,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-15 10:40:50,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-15 10:40:50,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 90 conjunts are in the unsatisfiable core [2022-02-15 10:40:50,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 10:40:51,029 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-15 10:40:51,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-15 10:40:51,043 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-15 10:40:51,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-15 10:40:51,660 INFO L387 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 11 treesize of output 7 [2022-02-15 10:40:51,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 21 [2022-02-15 10:40:52,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 10:40:52,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 25 [2022-02-15 10:40:53,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 10:40:53,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-02-15 10:40:53,580 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:40:53,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 10:41:07,665 WARN L838 $PredicateComparison]: unable to prove that (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_482 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_482) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))))) is different from false [2022-02-15 10:41:07,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:41:07,673 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-02-15 10:41:07,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 10:41:07,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-02-15 10:41:07,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-02-15 10:41:08,545 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-15 10:41:08,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-15 10:41:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 10:41:08,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010415718] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 10:41:08,593 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 10:41:08,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 34] total 81 [2022-02-15 10:41:08,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466107157] [2022-02-15 10:41:08,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 10:41:08,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-02-15 10:41:08,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 10:41:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-02-15 10:41:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=5836, Unknown=6, NotChecked=156, Total=6480 [2022-02-15 10:41:08,594 INFO L87 Difference]: Start difference. First operand 112367 states and 314224 transitions. Second operand has 81 states, 81 states have (on average 5.333333333333333) internal successors, (432), 81 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 10:41:15,825 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse0)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse5 (select .cse9 0)) (.cse6 (= c_~top~0 0)) (.cse7 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse1)) (.cse8 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse3 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (.cse4 (= (+ c_~top~0 1) 0)) (.cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) (and (or (and (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) .cse2 .cse3) .cse4) (<= .cse5 4) (<= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) (or .cse4 (not (= (select |c_#valid| |c_~#arr~0.base|) 0))) (<= c_~top~0 2) (<= 0 .cse5) (or .cse6 (forall ((v_ArrVal_484 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_40| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_54| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_40|) v_ArrVal_484)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_40|))))) (= |c_~#arr~0.offset| 0) (or .cse4 (and .cse7 .cse8 .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (or .cse6 (forall ((v_ArrVal_484 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_54| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_484)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (or .cse4 (and .cse7 .cse8 .cse2 .cse3)) (or (not (= (mod (select .cse9 (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294)) (= (+ |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 1) 0)) (<= 2 c_~top~0) (= 5 |c_~#arr~0.base|) (<= 1 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) (or .cse4 (and .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))))))))) is different from false [2022-02-15 10:41:17,203 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (let ((.cse1 (+ |c_~#arr~0.offset| .cse0))) (let ((.cse5 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse6 (= c_~top~0 0)) (.cse7 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) .cse1)) (.cse8 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse3 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (.cse4 (= (+ c_~top~0 1) 0)) (.cse2 (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#arr~0.base|)))) (and (or (and (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) .cse2 .cse3) .cse4) (<= .cse5 4) (or .cse4 (not (= (select |c_#valid| |c_~#arr~0.base|) 0))) (<= c_~top~0 2) (<= 0 .cse5) (or .cse6 (forall ((v_ArrVal_484 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_40| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_54| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_40|) v_ArrVal_484)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_40|))))) (= |c_~#arr~0.offset| 0) (or .cse4 (and .cse7 .cse8 .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (or .cse6 (forall ((v_ArrVal_484 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_54| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_54| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_484)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (or .cse4 (and .cse7 .cse8 .cse2 .cse3)) (<= 2 c_~top~0) (= 5 |c_~#arr~0.base|) (or .cse4 (and .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))))))))) is different from false [2022-02-15 10:41:38,210 WARN L228 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:42:04,665 WARN L228 SmtUtils]: Spent 21.44s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:42:26,565 WARN L228 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-15 10:42:59,702 WARN L228 SmtUtils]: Spent 16.12s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-02-15 10:43:02,170 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-15 10:43:02,170 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-15 10:43:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-02-15 10:43:02,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 350 SyntacticMatches, 21 SemanticMatches, 186 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 11647 ImplicationChecksByTransitivity, 123.1s TimeCoverageRelationStatistics Valid=3999, Invalid=30020, Unknown=33, NotChecked=1104, Total=35156 [2022-02-15 10:43:02,175 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 6020 mSDsluCounter, 22268 mSDsCounter, 0 mSdLazyCounter, 5549 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6020 SdHoareTripleChecker+Valid, 22338 SdHoareTripleChecker+Invalid, 7691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 5549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1881 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-15 10:43:02,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6020 Valid, 22338 Invalid, 7691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 5549 Invalid, 0 Unknown, 1881 Unchecked, 3.0s Time] [2022-02-15 10:43:02,176 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-15 10:43:02,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-15 10:43:02,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 10:43:02,378 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (112367states) and FLOYD_HOARE automaton (currently 121 states, 81 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 188 known predicates. [2022-02-15 10:43:02,379 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-02-15 10:43:02,379 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-02-15 10:43:02,379 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-02-15 10:43:02,379 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-02-15 10:43:02,379 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-15 10:43:02,381 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1] [2022-02-15 10:43:02,385 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-15 10:43:02,385 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 10:43:02,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:43:02 BasicIcfg [2022-02-15 10:43:02,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 10:43:02,389 INFO L158 Benchmark]: Toolchain (without parser) took 844548.99ms. Allocated memory was 196.1MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 143.8MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-02-15 10:43:02,389 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 10:43:02,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.06ms. Allocated memory was 196.1MB in the beginning and 252.7MB in the end (delta: 56.6MB). Free memory was 143.5MB in the beginning and 210.2MB in the end (delta: -66.7MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-02-15 10:43:02,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.70ms. Allocated memory is still 252.7MB. Free memory was 209.7MB in the beginning and 207.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 10:43:02,389 INFO L158 Benchmark]: Boogie Preprocessor took 24.55ms. Allocated memory is still 252.7MB. Free memory was 207.1MB in the beginning and 205.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-15 10:43:02,389 INFO L158 Benchmark]: RCFGBuilder took 478.62ms. Allocated memory is still 252.7MB. Free memory was 205.3MB in the beginning and 189.3MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-15 10:43:02,389 INFO L158 Benchmark]: TraceAbstraction took 843576.88ms. Allocated memory was 252.7MB in the beginning and 5.2GB in the end (delta: 4.9GB). Free memory was 188.7MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-02-15 10:43:02,395 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 410.06ms. Allocated memory was 196.1MB in the beginning and 252.7MB in the end (delta: 56.6MB). Free memory was 143.5MB in the beginning and 210.2MB in the end (delta: -66.7MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.70ms. Allocated memory is still 252.7MB. Free memory was 209.7MB in the beginning and 207.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.55ms. Allocated memory is still 252.7MB. Free memory was 207.1MB in the beginning and 205.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 478.62ms. Allocated memory is still 252.7MB. Free memory was 205.3MB in the beginning and 189.3MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 843576.88ms. Allocated memory was 252.7MB in the beginning and 5.2GB in the end (delta: 4.9GB). Free memory was 188.7MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (112367states) and FLOYD_HOARE automaton (currently 121 states, 81 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 188 known predicates. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (112367states) and FLOYD_HOARE automaton (currently 121 states, 81 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 188 known predicates. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (112367states) and FLOYD_HOARE automaton (currently 121 states, 81 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 188 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (112367states) and FLOYD_HOARE automaton (currently 121 states, 81 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 188 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 276 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 843.4s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 744.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45104 SdHoareTripleChecker+Valid, 24.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45104 mSDsluCounter, 182996 SdHoareTripleChecker+Invalid, 20.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 15712 IncrementalHoareTripleChecker+Unchecked, 181980 mSDsCounter, 1500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45567 IncrementalHoareTripleChecker+Invalid, 62779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1500 mSolverCounterUnsat, 7442 mSDtfsCounter, 45567 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3931 GetRequests, 2299 SyntacticMatches, 64 SemanticMatches, 1567 ConstructedPredicates, 28 IntricatePredicates, 12 DeprecatedPredicates, 160236 ImplicationChecksByTransitivity, 771.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112367occurred in iteration=13, InterpolantAutomatonStates: 1055, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 340940 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 82.9s InterpolantComputationTime, 3182 NumberOfCodeBlocks, 3136 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4383 ConstructedInterpolants, 108 QuantifiedInterpolants, 61921 SizeOfPredicates, 203 NumberOfNonLiveVariables, 2555 ConjunctsInSsa, 403 ConjunctsInUnsatCore, 28 InterpolantComputations, 8 PerfectInterpolantSequences, 139/1497 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown