./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:11:03,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:11:03,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:11:03,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:11:03,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:11:03,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:11:03,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:11:03,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:11:03,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:11:03,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:11:03,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:11:03,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:11:03,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:11:03,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:11:03,856 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:11:03,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:11:03,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:11:03,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:11:03,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:11:03,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:11:03,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:11:03,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:11:03,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:11:03,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:11:03,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:11:03,863 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:11:03,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:11:03,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:11:03,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:11:03,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:11:03,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:11:03,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:11:03,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:11:03,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:11:03,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:11:03,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:11:03,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:11:03,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:11:03,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:11:03,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:11:03,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:11:03,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:11:03,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:11:03,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:11:03,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2024-11-12 20:11:04,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:11:04,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:11:04,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:11:04,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:11:04,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:11:04,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-11-12 20:11:05,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:11:05,958 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:11:05,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-11-12 20:11:05,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930e4b5fa/430246f6fc244675a5b72163af5525da/FLAG9b7176d60 [2024-11-12 20:11:06,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930e4b5fa/430246f6fc244675a5b72163af5525da [2024-11-12 20:11:06,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:11:06,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:11:06,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:11:06,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:11:06,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:11:06,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:11:06" (1/1) ... [2024-11-12 20:11:06,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3cb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:06, skipping insertion in model container [2024-11-12 20:11:06,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:11:06" (1/1) ... [2024-11-12 20:11:06,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:11:06,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:11:06,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:11:07,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:11:07,064 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:11:07,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07 WrapperNode [2024-11-12 20:11:07,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:11:07,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:11:07,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:11:07,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:11:07,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,216 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3419 [2024-11-12 20:11:07,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:11:07,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:11:07,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:11:07,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:11:07,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,419 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2024-11-12 20:11:07,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:11:07,558 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:11:07,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:11:07,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:11:07,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (1/1) ... [2024-11-12 20:11:07,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:11:07,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:07,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 20:11:07,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 20:11:07,733 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-12 20:11:07,733 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-12 20:11:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:11:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:11:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 20:11:07,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:11:07,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:11:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:11:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:11:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 20:11:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:11:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:11:07,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 20:11:07,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:11:07,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:11:07,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 20:11:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:11:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:11:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:11:07,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:11:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 20:11:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 20:11:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:11:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:11:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 20:11:07,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:11:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:11:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:11:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 20:11:07,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:11:07,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:11:07,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:11:07,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:11:10,571 INFO L? ?]: Removed 789 outVars from TransFormulas that were not future-live. [2024-11-12 20:11:10,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:11:10,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:11:10,613 INFO L316 CfgBuilder]: Removed 151 assume(true) statements. [2024-11-12 20:11:10,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:11:10 BoogieIcfgContainer [2024-11-12 20:11:10,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:11:10,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:11:10,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:11:10,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:11:10,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:11:06" (1/3) ... [2024-11-12 20:11:10,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa9f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:11:10, skipping insertion in model container [2024-11-12 20:11:10,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:11:07" (2/3) ... [2024-11-12 20:11:10,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa9f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:11:10, skipping insertion in model container [2024-11-12 20:11:10,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:11:10" (3/3) ... [2024-11-12 20:11:10,621 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-1.i [2024-11-12 20:11:10,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:11:10,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 20:11:10,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:11:10,743 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@68254f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:11:10,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 20:11:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1018 states have (on average 1.6296660117878192) internal successors, (1659), 1028 states have internal predecessors, (1659), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 20:11:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:11:10,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:10,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:10,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:10,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1623223615, now seen corresponding path program 1 times [2024-11-12 20:11:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791946590] [2024-11-12 20:11:10,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:11:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791946590] [2024-11-12 20:11:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791946590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:10,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:10,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:11:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784947962] [2024-11-12 20:11:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:11:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:11:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:11:11,003 INFO L87 Difference]: Start difference. First operand has 1042 states, 1018 states have (on average 1.6296660117878192) internal successors, (1659), 1028 states have internal predecessors, (1659), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-11-12 20:11:11,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:11,100 INFO L93 Difference]: Finished difference Result 2081 states and 3379 transitions. [2024-11-12 20:11:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:11:11,102 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-11-12 20:11:11,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:11,125 INFO L225 Difference]: With dead ends: 2081 [2024-11-12 20:11:11,126 INFO L226 Difference]: Without dead ends: 1036 [2024-11-12 20:11:11,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:11:11,161 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:11,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:11:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2024-11-12 20:11:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2024-11-12 20:11:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1013 states have (on average 1.474827245804541) internal successors, (1494), 1023 states have internal predecessors, (1494), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:11:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1521 transitions. [2024-11-12 20:11:11,269 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1521 transitions. Word has length 7 [2024-11-12 20:11:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:11,270 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1521 transitions. [2024-11-12 20:11:11,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2024-11-12 20:11:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1521 transitions. [2024-11-12 20:11:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:11:11,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:11,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:11,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:11:11,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:11,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1623225537, now seen corresponding path program 1 times [2024-11-12 20:11:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:11,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205777050] [2024-11-12 20:11:11,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:11:11,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273285159] [2024-11-12 20:11:11,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:11,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:11,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:11,321 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) [2024-11-12 20:11:11,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:11:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:11,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 20:11:11,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:11,604 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-12 20:11:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:11:11,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205777050] [2024-11-12 20:11:11,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:11:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273285159] [2024-11-12 20:11:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273285159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:11,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:11:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676330825] [2024-11-12 20:11:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:11,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:11,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:11,648 INFO L87 Difference]: Start difference. First operand 1036 states and 1521 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-11-12 20:11:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:11,860 INFO L93 Difference]: Finished difference Result 1431 states and 2092 transitions. [2024-11-12 20:11:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-12 20:11:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:11,868 INFO L225 Difference]: With dead ends: 1431 [2024-11-12 20:11:11,868 INFO L226 Difference]: Without dead ends: 1429 [2024-11-12 20:11:11,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:11:11,870 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 553 mSDsluCounter, 3005 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 4562 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:11,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 4562 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:11:11,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2024-11-12 20:11:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1042. [2024-11-12 20:11:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1019 states have (on average 1.4730127576054957) internal successors, (1501), 1029 states have internal predecessors, (1501), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:11:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1528 transitions. [2024-11-12 20:11:11,912 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1528 transitions. Word has length 7 [2024-11-12 20:11:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:11,912 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1528 transitions. [2024-11-12 20:11:11,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-11-12 20:11:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1528 transitions. [2024-11-12 20:11:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 20:11:11,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:11,918 INFO L218 NwaCegarLoop]: 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] [2024-11-12 20:11:11,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:11:12,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:12,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:12,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1282007507, now seen corresponding path program 1 times [2024-11-12 20:11:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80040166] [2024-11-12 20:11:12,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:11:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80040166] [2024-11-12 20:11:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80040166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:11:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693165722] [2024-11-12 20:11:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:12,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:12,545 INFO L87 Difference]: Start difference. First operand 1042 states and 1528 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:11:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:12,720 INFO L93 Difference]: Finished difference Result 2064 states and 3034 transitions. [2024-11-12 20:11:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-12 20:11:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:12,726 INFO L225 Difference]: With dead ends: 2064 [2024-11-12 20:11:12,726 INFO L226 Difference]: Without dead ends: 1428 [2024-11-12 20:11:12,728 INFO L434 NwaCegarLoop]: 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 [2024-11-12 20:11:12,729 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 554 mSDsluCounter, 3007 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 4565 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:12,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 4565 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:11:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-12 20:11:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1042. [2024-11-12 20:11:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1019 states have (on average 1.4720314033366044) internal successors, (1500), 1029 states have internal predecessors, (1500), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:11:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1527 transitions. [2024-11-12 20:11:12,754 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1527 transitions. Word has length 64 [2024-11-12 20:11:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:12,754 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1527 transitions. [2024-11-12 20:11:12,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:11:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1527 transitions. [2024-11-12 20:11:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 20:11:12,759 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:12,759 INFO L218 NwaCegarLoop]: 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] [2024-11-12 20:11:12,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:11:12,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:12,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1733655611, now seen corresponding path program 1 times [2024-11-12 20:11:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:12,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296139455] [2024-11-12 20:11:12,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:11:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296139455] [2024-11-12 20:11:13,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296139455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:13,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:13,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:11:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004611071] [2024-11-12 20:11:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:13,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:13,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:13,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:13,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:13,099 INFO L87 Difference]: Start difference. First operand 1042 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2024-11-12 20:11:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:13,276 INFO L93 Difference]: Finished difference Result 2462 states and 3607 transitions. [2024-11-12 20:11:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:13,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2024-11-12 20:11:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:13,282 INFO L225 Difference]: With dead ends: 2462 [2024-11-12 20:11:13,283 INFO L226 Difference]: Without dead ends: 1428 [2024-11-12 20:11:13,284 INFO L434 NwaCegarLoop]: 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 [2024-11-12 20:11:13,285 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 548 mSDsluCounter, 3011 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:13,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 4573 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:11:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-12 20:11:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1043. [2024-11-12 20:11:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1020 states have (on average 1.4715686274509805) internal successors, (1501), 1030 states have internal predecessors, (1501), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:11:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1528 transitions. [2024-11-12 20:11:13,314 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1528 transitions. Word has length 82 [2024-11-12 20:11:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:13,315 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1528 transitions. [2024-11-12 20:11:13,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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) [2024-11-12 20:11:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1528 transitions. [2024-11-12 20:11:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 20:11:13,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:13,319 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:13,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:11:13,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:13,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -966050727, now seen corresponding path program 1 times [2024-11-12 20:11:13,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847378603] [2024-11-12 20:11:13,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:11:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:13,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847378603] [2024-11-12 20:11:13,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847378603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:13,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:13,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:11:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221092176] [2024-11-12 20:11:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:13,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:13,655 INFO L87 Difference]: Start difference. First operand 1043 states and 1528 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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) [2024-11-12 20:11:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:13,756 INFO L93 Difference]: Finished difference Result 2035 states and 2981 transitions. [2024-11-12 20:11:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:11:13,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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 153 [2024-11-12 20:11:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:13,761 INFO L225 Difference]: With dead ends: 2035 [2024-11-12 20:11:13,761 INFO L226 Difference]: Without dead ends: 1001 [2024-11-12 20:11:13,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:11:13,765 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 30 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:13,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4238 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:11:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-12 20:11:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2024-11-12 20:11:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 978 states have (on average 1.456032719836401) internal successors, (1424), 988 states have internal predecessors, (1424), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 20:11:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1451 transitions. [2024-11-12 20:11:13,806 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1451 transitions. Word has length 153 [2024-11-12 20:11:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:13,808 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1451 transitions. [2024-11-12 20:11:13,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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) [2024-11-12 20:11:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1451 transitions. [2024-11-12 20:11:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 20:11:13,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:13,813 INFO L218 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:13,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:11:13,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1901230747, now seen corresponding path program 1 times [2024-11-12 20:11:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093071945] [2024-11-12 20:11:13,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:11:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093071945] [2024-11-12 20:11:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093071945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:11:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116493451] [2024-11-12 20:11:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:14,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:11:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:11:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:11:14,017 INFO L87 Difference]: Start difference. First operand 1001 states and 1451 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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) [2024-11-12 20:11:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:14,097 INFO L93 Difference]: Finished difference Result 2524 states and 3676 transitions. [2024-11-12 20:11:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:11:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2024-11-12 20:11:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:14,104 INFO L225 Difference]: With dead ends: 2524 [2024-11-12 20:11:14,104 INFO L226 Difference]: Without dead ends: 1532 [2024-11-12 20:11:14,106 INFO L434 NwaCegarLoop]: 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 [2024-11-12 20:11:14,107 INFO L435 NwaCegarLoop]: 1436 mSDtfsCounter, 716 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:14,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2854 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:11:14,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-12 20:11:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1373. [2024-11-12 20:11:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1348 states have (on average 1.4584569732937684) internal successors, (1966), 1358 states have internal predecessors, (1966), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:11:14,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1997 transitions. [2024-11-12 20:11:14,137 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1997 transitions. Word has length 153 [2024-11-12 20:11:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:14,138 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1997 transitions. [2024-11-12 20:11:14,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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) [2024-11-12 20:11:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1997 transitions. [2024-11-12 20:11:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 20:11:14,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:14,140 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:14,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:11:14,140 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:14,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1840761358, now seen corresponding path program 1 times [2024-11-12 20:11:14,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:14,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064333234] [2024-11-12 20:11:14,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:11:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:11:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:11:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064333234] [2024-11-12 20:11:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064333234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:14,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:11:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698803737] [2024-11-12 20:11:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:14,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:11:14,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:11:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:11:14,575 INFO L87 Difference]: Start difference. First operand 1373 states and 1997 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:11:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:15,042 INFO L93 Difference]: Finished difference Result 2613 states and 3812 transitions. [2024-11-12 20:11:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:11:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-11-12 20:11:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:15,053 INFO L225 Difference]: With dead ends: 2613 [2024-11-12 20:11:15,053 INFO L226 Difference]: Without dead ends: 1334 [2024-11-12 20:11:15,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:11:15,056 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 55 mSDsluCounter, 3772 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5080 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:15,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 5080 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:11:15,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-12 20:11:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1331. [2024-11-12 20:11:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1306 states have (on average 1.4464012251148546) internal successors, (1889), 1316 states have internal predecessors, (1889), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:11:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1920 transitions. [2024-11-12 20:11:15,088 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1920 transitions. Word has length 168 [2024-11-12 20:11:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:15,089 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1920 transitions. [2024-11-12 20:11:15,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:11:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1920 transitions. [2024-11-12 20:11:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 20:11:15,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:15,092 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:15,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:11:15,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1062428864, now seen corresponding path program 1 times [2024-11-12 20:11:15,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:15,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485468716] [2024-11-12 20:11:15,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:11:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:11:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:11:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485468716] [2024-11-12 20:11:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485468716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:11:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204182832] [2024-11-12 20:11:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:15,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:15,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:15,418 INFO L87 Difference]: Start difference. First operand 1331 states and 1920 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:11:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:15,960 INFO L93 Difference]: Finished difference Result 2571 states and 3724 transitions. [2024-11-12 20:11:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-11-12 20:11:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:15,966 INFO L225 Difference]: With dead ends: 2571 [2024-11-12 20:11:15,966 INFO L226 Difference]: Without dead ends: 1334 [2024-11-12 20:11:15,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:15,969 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 26 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3816 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:15,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3816 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:11:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-11-12 20:11:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1331. [2024-11-12 20:11:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1306 states have (on average 1.444104134762634) internal successors, (1886), 1316 states have internal predecessors, (1886), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 20:11:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1917 transitions. [2024-11-12 20:11:15,999 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1917 transitions. Word has length 168 [2024-11-12 20:11:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:16,000 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 1917 transitions. [2024-11-12 20:11:16,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:11:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1917 transitions. [2024-11-12 20:11:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 20:11:16,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:16,002 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:16,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 20:11:16,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -395652924, now seen corresponding path program 1 times [2024-11-12 20:11:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:16,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326498032] [2024-11-12 20:11:16,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:11:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:11:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:11:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:16,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326498032] [2024-11-12 20:11:16,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326498032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:16,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:16,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:11:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946757741] [2024-11-12 20:11:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:16,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:16,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:16,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:16,285 INFO L87 Difference]: Start difference. First operand 1331 states and 1917 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:11:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:16,849 INFO L93 Difference]: Finished difference Result 3142 states and 4552 transitions. [2024-11-12 20:11:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-11-12 20:11:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:16,858 INFO L225 Difference]: With dead ends: 3142 [2024-11-12 20:11:16,858 INFO L226 Difference]: Without dead ends: 1905 [2024-11-12 20:11:16,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:11:16,862 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 622 mSDsluCounter, 2725 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 4281 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:16,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 4281 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:11:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-11-12 20:11:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1897. [2024-11-12 20:11:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1866 states have (on average 1.4458735262593783) internal successors, (2698), 1876 states have internal predecessors, (2698), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 20:11:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2741 transitions. [2024-11-12 20:11:16,909 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2741 transitions. Word has length 168 [2024-11-12 20:11:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:16,909 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 2741 transitions. [2024-11-12 20:11:16,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:11:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2741 transitions. [2024-11-12 20:11:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-12 20:11:16,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:16,912 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:16,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 20:11:16,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:16,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1553695454, now seen corresponding path program 1 times [2024-11-12 20:11:16,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498011497] [2024-11-12 20:11:16,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:11:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:17,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:11:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 20:11:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 20:11:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:11:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498011497] [2024-11-12 20:11:17,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498011497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:17,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:17,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:11:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778938110] [2024-11-12 20:11:17,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:17,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:11:17,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:17,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:11:17,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:11:17,469 INFO L87 Difference]: Start difference. First operand 1897 states and 2741 transitions. Second operand has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:18,045 INFO L93 Difference]: Finished difference Result 1966 states and 2842 transitions. [2024-11-12 20:11:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:11:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2024-11-12 20:11:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:18,053 INFO L225 Difference]: With dead ends: 1966 [2024-11-12 20:11:18,053 INFO L226 Difference]: Without dead ends: 1964 [2024-11-12 20:11:18,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:11:18,055 INFO L435 NwaCegarLoop]: 1365 mSDtfsCounter, 246 mSDsluCounter, 3835 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 5200 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:18,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 5200 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:11:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-12 20:11:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1961. [2024-11-12 20:11:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1927 states have (on average 1.4405812143227816) internal successors, (2776), 1937 states have internal predecessors, (2776), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 20:11:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2825 transitions. [2024-11-12 20:11:18,095 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2825 transitions. Word has length 183 [2024-11-12 20:11:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:18,096 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2825 transitions. [2024-11-12 20:11:18,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2825 transitions. [2024-11-12 20:11:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 20:11:18,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:18,098 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:18,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 20:11:18,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2016601605, now seen corresponding path program 1 times [2024-11-12 20:11:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:18,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570208251] [2024-11-12 20:11:18,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:11:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:11:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 20:11:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 20:11:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:11:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570208251] [2024-11-12 20:11:19,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570208251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:19,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541319389] [2024-11-12 20:11:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:19,130 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) [2024-11-12 20:11:19,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:11:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:19,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 20:11:19,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:19,804 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-12 20:11:19,826 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-12 20:11:19,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2024-11-12 20:11:20,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 20:11:20,320 INFO L378 Elim1Store]: Elim1 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 77 treesize of output 55 [2024-11-12 20:11:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:11:20,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541319389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:11:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-12 20:11:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652654667] [2024-11-12 20:11:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:20,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:11:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:11:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:11:20,594 INFO L87 Difference]: Start difference. First operand 1961 states and 2825 transitions. Second operand has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:21,946 INFO L93 Difference]: Finished difference Result 3889 states and 5610 transitions. [2024-11-12 20:11:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:11:21,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2024-11-12 20:11:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:21,954 INFO L225 Difference]: With dead ends: 3889 [2024-11-12 20:11:21,955 INFO L226 Difference]: Without dead ends: 1975 [2024-11-12 20:11:21,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-11-12 20:11:21,958 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 520 mSDsluCounter, 7521 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 8871 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:21,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 8871 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 20:11:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2024-11-12 20:11:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1961. [2024-11-12 20:11:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1927 states have (on average 1.4400622729631551) internal successors, (2775), 1937 states have internal predecessors, (2775), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 20:11:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2824 transitions. [2024-11-12 20:11:22,003 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2824 transitions. Word has length 189 [2024-11-12 20:11:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2824 transitions. [2024-11-12 20:11:22,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2824 transitions. [2024-11-12 20:11:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 20:11:22,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:22,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:22,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:11:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 20:11:22,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:22,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1269068824, now seen corresponding path program 1 times [2024-11-12 20:11:22,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:22,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344446090] [2024-11-12 20:11:22,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:11:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:11:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 20:11:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 20:11:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:11:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:23,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344446090] [2024-11-12 20:11:23,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344446090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:23,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448609589] [2024-11-12 20:11:23,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:23,022 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) [2024-11-12 20:11:23,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:11:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:23,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 20:11:23,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:11:23,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:23,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448609589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:23,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:11:23,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-12 20:11:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546158119] [2024-11-12 20:11:23,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:23,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:23,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:23,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:11:23,955 INFO L87 Difference]: Start difference. First operand 1961 states and 2824 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:24,104 INFO L93 Difference]: Finished difference Result 3875 states and 5595 transitions. [2024-11-12 20:11:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2024-11-12 20:11:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:24,112 INFO L225 Difference]: With dead ends: 3875 [2024-11-12 20:11:24,113 INFO L226 Difference]: Without dead ends: 1961 [2024-11-12 20:11:24,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:11:24,116 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 17 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:24,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3906 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:11:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-11-12 20:11:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2024-11-12 20:11:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1927 states have (on average 1.4390243902439024) internal successors, (2773), 1937 states have internal predecessors, (2773), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 20:11:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2822 transitions. [2024-11-12 20:11:24,160 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2822 transitions. Word has length 190 [2024-11-12 20:11:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2822 transitions. [2024-11-12 20:11:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2822 transitions. [2024-11-12 20:11:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 20:11:24,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:24,162 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:24,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 20:11:24,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:24,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash 395230400, now seen corresponding path program 1 times [2024-11-12 20:11:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069198992] [2024-11-12 20:11:24,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:11:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:11:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 20:11:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 20:11:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:11:24,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:24,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069198992] [2024-11-12 20:11:24,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069198992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:24,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:24,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 20:11:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539735321] [2024-11-12 20:11:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:24,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:11:24,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:11:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:11:24,891 INFO L87 Difference]: Start difference. First operand 1961 states and 2822 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:25,483 INFO L93 Difference]: Finished difference Result 3881 states and 5612 transitions. [2024-11-12 20:11:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:11:25,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-11-12 20:11:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:25,492 INFO L225 Difference]: With dead ends: 3881 [2024-11-12 20:11:25,492 INFO L226 Difference]: Without dead ends: 1970 [2024-11-12 20:11:25,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:11:25,495 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 33 mSDsluCounter, 4930 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 6247 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:25,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 6247 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:11:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-11-12 20:11:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1967. [2024-11-12 20:11:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1933 states have (on average 1.437661665804449) internal successors, (2779), 1943 states have internal predecessors, (2779), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 20:11:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2828 transitions. [2024-11-12 20:11:25,537 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2828 transitions. Word has length 191 [2024-11-12 20:11:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:25,537 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 2828 transitions. [2024-11-12 20:11:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 6 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2828 transitions. [2024-11-12 20:11:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 20:11:25,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:25,539 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:25,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 20:11:25,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:25,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1456007841, now seen corresponding path program 1 times [2024-11-12 20:11:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688474808] [2024-11-12 20:11:25,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 20:11:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 20:11:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 20:11:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 20:11:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:26,023 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:11:26,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:26,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688474808] [2024-11-12 20:11:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688474808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:26,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:26,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 20:11:26,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34017643] [2024-11-12 20:11:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:11:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:26,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:11:26,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:11:26,026 INFO L87 Difference]: Start difference. First operand 1967 states and 2828 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:26,716 INFO L93 Difference]: Finished difference Result 3887 states and 5616 transitions. [2024-11-12 20:11:26,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:11:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2024-11-12 20:11:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:26,724 INFO L225 Difference]: With dead ends: 3887 [2024-11-12 20:11:26,724 INFO L226 Difference]: Without dead ends: 1980 [2024-11-12 20:11:26,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:11:26,727 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 37 mSDsluCounter, 7379 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8686 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:26,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8686 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 20:11:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-12 20:11:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1975. [2024-11-12 20:11:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1941 states have (on average 1.4368882019577538) internal successors, (2789), 1951 states have internal predecessors, (2789), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 20:11:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2838 transitions. [2024-11-12 20:11:26,766 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2838 transitions. Word has length 192 [2024-11-12 20:11:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:26,766 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 2838 transitions. [2024-11-12 20:11:26,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2838 transitions. [2024-11-12 20:11:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 20:11:26,768 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:26,768 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:26,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 20:11:26,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1004567675, now seen corresponding path program 1 times [2024-11-12 20:11:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:26,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954212747] [2024-11-12 20:11:26,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 20:11:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 20:11:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:27,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 20:11:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:27,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 20:11:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:11:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954212747] [2024-11-12 20:11:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954212747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795363644] [2024-11-12 20:11:27,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:27,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:27,455 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) [2024-11-12 20:11:27,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 20:11:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:28,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 20:11:28,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 20:11:28,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795363644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:11:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-12 20:11:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005820669] [2024-11-12 20:11:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:28,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:11:28,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:11:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:11:28,200 INFO L87 Difference]: Start difference. First operand 1975 states and 2838 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:11:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:28,250 INFO L93 Difference]: Finished difference Result 3849 states and 5556 transitions. [2024-11-12 20:11:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:11:28,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2024-11-12 20:11:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:28,266 INFO L225 Difference]: With dead ends: 3849 [2024-11-12 20:11:28,266 INFO L226 Difference]: Without dead ends: 1978 [2024-11-12 20:11:28,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:11:28,270 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 0 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:28,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4043 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:11:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-12 20:11:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-12 20:11:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1943 states have (on average 1.4369531652084406) internal successors, (2792), 1954 states have internal predecessors, (2792), 25 states have call successors, (25), 3 states have call predecessors, (25), 4 states have return successors, (28), 21 states have call predecessors, (28), 24 states have call successors, (28) [2024-11-12 20:11:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2845 transitions. [2024-11-12 20:11:28,310 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2845 transitions. Word has length 192 [2024-11-12 20:11:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:28,310 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2845 transitions. [2024-11-12 20:11:28,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:11:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2845 transitions. [2024-11-12 20:11:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-12 20:11:28,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:28,313 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:28,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 20:11:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 20:11:28,514 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-12 20:11:28,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 69615361, now seen corresponding path program 1 times [2024-11-12 20:11:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:28,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646979354] [2024-11-12 20:11:28,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:28,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:29,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 20:11:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 20:11:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:29,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 20:11:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:29,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-12 20:11:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:11:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646979354] [2024-11-12 20:11:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646979354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811914033] [2024-11-12 20:11:29,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:29,602 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) [2024-11-12 20:11:29,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 20:11:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:30,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 165 conjuncts are in the unsatisfiable core [2024-11-12 20:11:30,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:30,488 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-11-12 20:11:30,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-12 20:11:30,530 INFO L378 Elim1Store]: Elim1 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 [2024-11-12 20:11:30,563 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 11 [2024-11-12 20:11:30,848 INFO L378 Elim1Store]: Elim1 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 49 treesize of output 11 [2024-11-12 20:11:30,867 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 11 [2024-11-12 20:11:30,884 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-12 20:11:30,899 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2024-11-12 20:11:30,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2024-11-12 20:11:30,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 20:11:30,914 INFO L378 Elim1Store]: Elim1 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 13 treesize of output 9 [2024-11-12 20:11:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-12 20:11:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:11:31,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-12 20:11:31,209 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-12 20:11:31,210 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 45 [2024-11-12 20:11:31,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-12 20:11:31,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2024-11-12 20:11:53,201 INFO L224 Elim1Store]: Index analysis took 1388 ms