./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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_BER_test4-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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 13:29:15,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 13:29:15,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 13:29:15,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 13:29:15,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 13:29:15,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 13:29:15,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 13:29:15,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 13:29:15,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 13:29:15,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 13:29:15,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 13:29:15,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 13:29:15,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 13:29:15,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 13:29:15,996 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 13:29:15,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 13:29:15,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 13:29:15,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 13:29:15,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 13:29:15,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 13:29:15,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 13:29:15,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 13:29:15,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 13:29:15,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 13:29:15,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 13:29:15,999 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 13:29:15,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 13:29:16,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 13:29:16,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 13:29:16,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 13:29:16,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 13:29:16,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 13:29:16,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 13:29:16,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 13:29:16,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:29:16,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 13:29:16,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 13:29:16,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 13:29:16,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 13:29:16,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 13:29:16,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 13:29:16,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 13:29:16,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 13:29:16,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 13:29:16,003 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2024-11-19 13:29:16,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 13:29:16,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 13:29:16,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 13:29:16,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 13:29:16,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 13:29:16,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-19 13:29:17,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 13:29:17,594 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 13:29:17,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-19 13:29:17,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ce42cd3/1bfc291dae84420b92d43e62976d3c32/FLAG40dd27dc9 [2024-11-19 13:29:17,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18ce42cd3/1bfc291dae84420b92d43e62976d3c32 [2024-11-19 13:29:17,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 13:29:17,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 13:29:17,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 13:29:17,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 13:29:17,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 13:29:17,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:29:17" (1/1) ... [2024-11-19 13:29:17,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125a07bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:17, skipping insertion in model container [2024-11-19 13:29:17,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:29:17" (1/1) ... [2024-11-19 13:29:17,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 13:29:18,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:29:18,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 13:29:18,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 13:29:18,484 INFO L204 MainTranslator]: Completed translation [2024-11-19 13:29:18,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18 WrapperNode [2024-11-19 13:29:18,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 13:29:18,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 13:29:18,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 13:29:18,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 13:29:18,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,593 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1597 [2024-11-19 13:29:18,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 13:29:18,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 13:29:18,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 13:29:18,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 13:29:18,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,677 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-19 13:29:18,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 13:29:18,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 13:29:18,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 13:29:18,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 13:29:18,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (1/1) ... [2024-11-19 13:29:18,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 13:29:18,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:29:18,795 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-19 13:29:18,797 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-19 13:29:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 13:29:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 13:29:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 13:29:18,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 13:29:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 13:29:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 13:29:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 13:29:18,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 13:29:18,829 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 13:29:18,830 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 13:29:18,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 13:29:18,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 13:29:18,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 13:29:18,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 13:29:18,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 13:29:20,137 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-19 13:29:20,137 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 13:29:20,156 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 13:29:20,156 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-19 13:29:20,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:29:20 BoogieIcfgContainer [2024-11-19 13:29:20,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 13:29:20,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 13:29:20,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 13:29:20,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 13:29:20,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:29:17" (1/3) ... [2024-11-19 13:29:20,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d711e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:29:20, skipping insertion in model container [2024-11-19 13:29:20,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:29:18" (2/3) ... [2024-11-19 13:29:20,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d711e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:29:20, skipping insertion in model container [2024-11-19 13:29:20,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:29:20" (3/3) ... [2024-11-19 13:29:20,162 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2024-11-19 13:29:20,174 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 13:29:20,174 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 13:29:20,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 13:29:20,231 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;@255ed6f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 13:29:20,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 13:29:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 437 states, 412 states have (on average 1.6213592233009708) internal successors, (668), 428 states have internal predecessors, (668), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 13:29:20,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:20,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 13:29:20,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:20,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1408033094, now seen corresponding path program 1 times [2024-11-19 13:29:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:20,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298717779] [2024-11-19 13:29:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:20,380 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-19 13:29:20,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:20,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298717779] [2024-11-19 13:29:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298717779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 13:29:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803316303] [2024-11-19 13:29:20,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:20,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 13:29:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:20,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 13:29:20,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 13:29:20,406 INFO L87 Difference]: Start difference. First operand has 437 states, 412 states have (on average 1.6213592233009708) internal successors, (668), 428 states have internal predecessors, (668), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-19 13:29:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:20,460 INFO L93 Difference]: Finished difference Result 870 states and 1407 transitions. [2024-11-19 13:29:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 13:29:20,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-19 13:29:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:20,472 INFO L225 Difference]: With dead ends: 870 [2024-11-19 13:29:20,472 INFO L226 Difference]: Without dead ends: 430 [2024-11-19 13:29:20,475 INFO L431 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-19 13:29:20,479 INFO L432 NwaCegarLoop]: 629 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, 629 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-19 13:29:20,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-19 13:29:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-19 13:29:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 407 states have (on average 1.4545454545454546) internal successors, (592), 421 states have internal predecessors, (592), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions. [2024-11-19 13:29:20,533 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 6 [2024-11-19 13:29:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:20,533 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 624 transitions. [2024-11-19 13:29:20,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-19 13:29:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions. [2024-11-19 13:29:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 13:29:20,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:20,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 13:29:20,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 13:29:20,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:20,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:20,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1364389279, now seen corresponding path program 1 times [2024-11-19 13:29:20,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:20,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909407603] [2024-11-19 13:29:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:20,608 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-19 13:29:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:20,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909407603] [2024-11-19 13:29:20,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909407603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:29:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968002540] [2024-11-19 13:29:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:20,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:29:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:29:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:29:20,612 INFO L87 Difference]: Start difference. First operand 430 states and 624 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 13:29:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:20,671 INFO L93 Difference]: Finished difference Result 850 states and 1238 transitions. [2024-11-19 13:29:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:29:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-19 13:29:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:20,677 INFO L225 Difference]: With dead ends: 850 [2024-11-19 13:29:20,677 INFO L226 Difference]: Without dead ends: 816 [2024-11-19 13:29:20,678 INFO L431 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-19 13:29:20,679 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 547 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:20,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1282 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-19 13:29:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 435. [2024-11-19 13:29:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 412 states have (on average 1.4490291262135921) internal successors, (597), 426 states have internal predecessors, (597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 629 transitions. [2024-11-19 13:29:20,697 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 629 transitions. Word has length 6 [2024-11-19 13:29:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:20,698 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 629 transitions. [2024-11-19 13:29:20,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-19 13:29:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 629 transitions. [2024-11-19 13:29:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 13:29:20,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:20,703 INFO L215 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] [2024-11-19 13:29:20,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 13:29:20,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:20,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash -220519858, now seen corresponding path program 1 times [2024-11-19 13:29:20,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:20,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660251559] [2024-11-19 13:29:20,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:20,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:21,245 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-19 13:29:21,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:21,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660251559] [2024-11-19 13:29:21,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660251559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:21,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:21,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 13:29:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497714167] [2024-11-19 13:29:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:21,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 13:29:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 13:29:21,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:29:21,248 INFO L87 Difference]: Start difference. First operand 435 states and 629 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-19 13:29:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:21,330 INFO L93 Difference]: Finished difference Result 866 states and 1254 transitions. [2024-11-19 13:29:21,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:29:21,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 151 [2024-11-19 13:29:21,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:21,332 INFO L225 Difference]: With dead ends: 866 [2024-11-19 13:29:21,332 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 13:29:21,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:29:21,333 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 87 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:21,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2279 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:29:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 13:29:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2024-11-19 13:29:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 412 states have (on average 1.4320388349514563) internal successors, (590), 426 states have internal predecessors, (590), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 622 transitions. [2024-11-19 13:29:21,343 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 622 transitions. Word has length 151 [2024-11-19 13:29:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:21,343 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 622 transitions. [2024-11-19 13:29:21,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-19 13:29:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 622 transitions. [2024-11-19 13:29:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 13:29:21,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:21,348 INFO L215 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] [2024-11-19 13:29:21,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 13:29:21,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -315882022, now seen corresponding path program 1 times [2024-11-19 13:29:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841955276] [2024-11-19 13:29:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:21,592 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-19 13:29:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841955276] [2024-11-19 13:29:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841955276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:29:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716375069] [2024-11-19 13:29:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:29:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:29:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:29:21,595 INFO L87 Difference]: Start difference. First operand 435 states and 622 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-19 13:29:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:21,641 INFO L93 Difference]: Finished difference Result 869 states and 1246 transitions. [2024-11-19 13:29:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:29:21,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2024-11-19 13:29:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:21,644 INFO L225 Difference]: With dead ends: 869 [2024-11-19 13:29:21,644 INFO L226 Difference]: Without dead ends: 441 [2024-11-19 13:29:21,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:29:21,646 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 1 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:21,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1200 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-19 13:29:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-19 13:29:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 432 states have internal predecessors, (596), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-19 13:29:21,659 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 151 [2024-11-19 13:29:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:21,660 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-19 13:29:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-19 13:29:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-19 13:29:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-19 13:29:21,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:21,664 INFO L215 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] [2024-11-19 13:29:21,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 13:29:21,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:21,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash -803929128, now seen corresponding path program 1 times [2024-11-19 13:29:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:21,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937221971] [2024-11-19 13:29:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:21,840 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-19 13:29:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:21,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937221971] [2024-11-19 13:29:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937221971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:21,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:29:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105981852] [2024-11-19 13:29:21,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:21,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:29:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:21,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:29:21,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:29:21,844 INFO L87 Difference]: Start difference. First operand 441 states and 628 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-19 13:29:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:21,910 INFO L93 Difference]: Finished difference Result 1008 states and 1442 transitions. [2024-11-19 13:29:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:29:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2024-11-19 13:29:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:21,914 INFO L225 Difference]: With dead ends: 1008 [2024-11-19 13:29:21,914 INFO L226 Difference]: Without dead ends: 574 [2024-11-19 13:29:21,915 INFO L431 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-19 13:29:21,916 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 134 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:21,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1225 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-19 13:29:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-11-19 13:29:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 551 states have (on average 1.4301270417422867) internal successors, (788), 565 states have internal predecessors, (788), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 820 transitions. [2024-11-19 13:29:21,931 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 820 transitions. Word has length 151 [2024-11-19 13:29:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:21,932 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 820 transitions. [2024-11-19 13:29:21,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-19 13:29:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 820 transitions. [2024-11-19 13:29:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-19 13:29:21,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:21,935 INFO L215 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] [2024-11-19 13:29:21,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 13:29:21,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2044506263, now seen corresponding path program 1 times [2024-11-19 13:29:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166168284] [2024-11-19 13:29:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:22,221 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-19 13:29:22,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:22,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166168284] [2024-11-19 13:29:22,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166168284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:22,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:22,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 13:29:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782782454] [2024-11-19 13:29:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:22,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:29:22,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:29:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:29:22,223 INFO L87 Difference]: Start difference. First operand 574 states and 820 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-19 13:29:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:22,291 INFO L93 Difference]: Finished difference Result 966 states and 1375 transitions. [2024-11-19 13:29:22,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 13:29:22,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 166 [2024-11-19 13:29:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:22,295 INFO L225 Difference]: With dead ends: 966 [2024-11-19 13:29:22,295 INFO L226 Difference]: Without dead ends: 532 [2024-11-19 13:29:22,295 INFO L431 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-19 13:29:22,296 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 30 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1526 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:22,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1526 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-19 13:29:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2024-11-19 13:29:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 509 states have (on average 1.3968565815324165) internal successors, (711), 523 states have internal predecessors, (711), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 13:29:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 743 transitions. [2024-11-19 13:29:22,305 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 743 transitions. Word has length 166 [2024-11-19 13:29:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:22,306 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 743 transitions. [2024-11-19 13:29:22,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-19 13:29:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 743 transitions. [2024-11-19 13:29:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-19 13:29:22,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:22,307 INFO L215 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] [2024-11-19 13:29:22,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 13:29:22,307 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash -467033507, now seen corresponding path program 1 times [2024-11-19 13:29:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922369822] [2024-11-19 13:29:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:22,534 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-19 13:29:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922369822] [2024-11-19 13:29:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922369822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:22,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:29:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324171527] [2024-11-19 13:29:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:22,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 13:29:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:22,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 13:29:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 13:29:22,535 INFO L87 Difference]: Start difference. First operand 532 states and 743 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-19 13:29:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:22,578 INFO L93 Difference]: Finished difference Result 1070 states and 1485 transitions. [2024-11-19 13:29:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 13:29:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 166 [2024-11-19 13:29:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:22,584 INFO L225 Difference]: With dead ends: 1070 [2024-11-19 13:29:22,584 INFO L226 Difference]: Without dead ends: 678 [2024-11-19 13:29:22,585 INFO L431 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-19 13:29:22,585 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 243 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:22,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1058 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-19 13:29:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2024-11-19 13:29:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 652 states have (on average 1.383435582822086) internal successors, (902), 666 states have internal predecessors, (902), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 13:29:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 940 transitions. [2024-11-19 13:29:22,602 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 940 transitions. Word has length 166 [2024-11-19 13:29:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:22,603 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 940 transitions. [2024-11-19 13:29:22,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-19 13:29:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 940 transitions. [2024-11-19 13:29:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-19 13:29:22,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:22,605 INFO L215 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] [2024-11-19 13:29:22,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 13:29:22,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1374700938, now seen corresponding path program 1 times [2024-11-19 13:29:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907318610] [2024-11-19 13:29:22,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:22,922 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-19 13:29:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:22,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907318610] [2024-11-19 13:29:22,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907318610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:22,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:22,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 13:29:22,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635150108] [2024-11-19 13:29:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:29:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:22,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:29:22,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 13:29:22,925 INFO L87 Difference]: Start difference. First operand 678 states and 940 transitions. Second operand has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 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-19 13:29:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:22,964 INFO L93 Difference]: Finished difference Result 744 states and 1026 transitions. [2024-11-19 13:29:22,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:29:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 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 181 [2024-11-19 13:29:22,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:22,968 INFO L225 Difference]: With dead ends: 744 [2024-11-19 13:29:22,968 INFO L226 Difference]: Without dead ends: 742 [2024-11-19 13:29:22,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 13:29:22,968 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 295 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:22,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1661 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:22,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-19 13:29:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2024-11-19 13:29:22,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 713 states have (on average 1.3744740532959328) internal successors, (980), 727 states have internal predecessors, (980), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 13:29:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1024 transitions. [2024-11-19 13:29:22,985 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1024 transitions. Word has length 181 [2024-11-19 13:29:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:22,986 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1024 transitions. [2024-11-19 13:29:22,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 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-19 13:29:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1024 transitions. [2024-11-19 13:29:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 13:29:22,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:22,989 INFO L215 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, 1, 1, 1] [2024-11-19 13:29:22,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 13:29:22,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:22,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1170292628, now seen corresponding path program 1 times [2024-11-19 13:29:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306836262] [2024-11-19 13:29:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 13:29:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306836262] [2024-11-19 13:29:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306836262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:29:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007351982] [2024-11-19 13:29:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:23,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:23,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:29:23,322 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-19 13:29:23,323 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-19 13:29:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:23,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 13:29:23,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:29:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 13:29:23,880 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 13:29:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 13:29:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007351982] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 13:29:24,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 13:29:24,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 13:29:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477705541] [2024-11-19 13:29:24,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 13:29:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 13:29:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 13:29:24,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 13:29:24,103 INFO L87 Difference]: Start difference. First operand 742 states and 1024 transitions. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 13:29:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:24,223 INFO L93 Difference]: Finished difference Result 1129 states and 1566 transitions. [2024-11-19 13:29:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 13:29:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 186 [2024-11-19 13:29:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:24,227 INFO L225 Difference]: With dead ends: 1129 [2024-11-19 13:29:24,227 INFO L226 Difference]: Without dead ends: 1095 [2024-11-19 13:29:24,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 13:29:24,228 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 1508 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:24,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 3646 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:29:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2024-11-19 13:29:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2024-11-19 13:29:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1060 states have (on average 1.3726415094339623) internal successors, (1455), 1074 states have internal predecessors, (1455), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 13:29:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1511 transitions. [2024-11-19 13:29:24,245 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1511 transitions. Word has length 186 [2024-11-19 13:29:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:24,245 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1511 transitions. [2024-11-19 13:29:24,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 13:29:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1511 transitions. [2024-11-19 13:29:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-19 13:29:24,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:24,247 INFO L215 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] [2024-11-19 13:29:24,262 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-19 13:29:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:24,448 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:24,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1876231077, now seen corresponding path program 1 times [2024-11-19 13:29:24,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631638153] [2024-11-19 13:29:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:24,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:25,231 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-19 13:29:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631638153] [2024-11-19 13:29:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631638153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:29:25,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141173231] [2024-11-19 13:29:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:29:25,234 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-19 13:29:25,241 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-19 13:29:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:25,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 13:29:25,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:29:25,709 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-19 13:29:25,726 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-19 13:29:26,295 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-19 13:29:26,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:29:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141173231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:26,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:29:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2024-11-19 13:29:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848723878] [2024-11-19 13:29:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:26,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 13:29:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 13:29:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-19 13:29:26,297 INFO L87 Difference]: Start difference. First operand 1095 states and 1511 transitions. Second operand has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 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-19 13:29:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:27,855 INFO L93 Difference]: Finished difference Result 2134 states and 2939 transitions. [2024-11-19 13:29:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 13:29:27,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 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 187 [2024-11-19 13:29:27,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:27,859 INFO L225 Difference]: With dead ends: 2134 [2024-11-19 13:29:27,860 INFO L226 Difference]: Without dead ends: 1132 [2024-11-19 13:29:27,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-19 13:29:27,861 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 721 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:27,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 3099 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 13:29:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-19 13:29:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1127. [2024-11-19 13:29:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1092 states have (on average 1.3663003663003663) internal successors, (1492), 1106 states have internal predecessors, (1492), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 13:29:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1548 transitions. [2024-11-19 13:29:27,881 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1548 transitions. Word has length 187 [2024-11-19 13:29:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:27,881 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1548 transitions. [2024-11-19 13:29:27,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 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-19 13:29:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1548 transitions. [2024-11-19 13:29:27,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-19 13:29:27,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:27,883 INFO L215 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] [2024-11-19 13:29:27,899 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-19 13:29:28,083 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,SelfDestructingSolverStorable9 [2024-11-19 13:29:28,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2110538288, now seen corresponding path program 1 times [2024-11-19 13:29:28,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:28,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437586885] [2024-11-19 13:29:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:28,814 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-19 13:29:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437586885] [2024-11-19 13:29:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437586885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:29:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4847906] [2024-11-19 13:29:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:29:28,821 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-19 13:29:28,822 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-19 13:29:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:29,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 13:29:29,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:29:29,344 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-19 13:29:29,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:29:29,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4847906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:29,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:29:29,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-19 13:29:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435987158] [2024-11-19 13:29:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:29,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:29:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:29,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:29:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:29:29,346 INFO L87 Difference]: Start difference. First operand 1127 states and 1548 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-19 13:29:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:29,509 INFO L93 Difference]: Finished difference Result 2220 states and 3049 transitions. [2024-11-19 13:29:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:29:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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 188 [2024-11-19 13:29:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:29,512 INFO L225 Difference]: With dead ends: 2220 [2024-11-19 13:29:29,513 INFO L226 Difference]: Without dead ends: 1218 [2024-11-19 13:29:29,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:29:29,514 INFO L432 NwaCegarLoop]: 525 mSDtfsCounter, 17 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:29,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1385 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 13:29:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-19 13:29:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1194. [2024-11-19 13:29:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1159 states have (on average 1.355478861087144) internal successors, (1571), 1173 states have internal predecessors, (1571), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 13:29:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1627 transitions. [2024-11-19 13:29:29,533 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1627 transitions. Word has length 188 [2024-11-19 13:29:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:29,533 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1627 transitions. [2024-11-19 13:29:29,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-19 13:29:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1627 transitions. [2024-11-19 13:29:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 13:29:29,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:29,535 INFO L215 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-19 13:29:29,552 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-19 13:29:29,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:29,739 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:29,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:29,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1224994656, now seen corresponding path program 1 times [2024-11-19 13:29:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950988332] [2024-11-19 13:29:29,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:29,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:30,116 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-19 13:29:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950988332] [2024-11-19 13:29:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950988332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 13:29:30,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241141620] [2024-11-19 13:29:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:30,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 13:29:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 13:29:30,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:29:30,119 INFO L87 Difference]: Start difference. First operand 1194 states and 1627 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 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-19 13:29:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:30,443 INFO L93 Difference]: Finished difference Result 2277 states and 3110 transitions. [2024-11-19 13:29:30,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 13:29:30,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 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-19 13:29:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:30,448 INFO L225 Difference]: With dead ends: 2277 [2024-11-19 13:29:30,448 INFO L226 Difference]: Without dead ends: 1212 [2024-11-19 13:29:30,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 13:29:30,449 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 8 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:30,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1717 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 13:29:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-19 13:29:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1206. [2024-11-19 13:29:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1185 states have internal predecessors, (1586), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 13:29:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1642 transitions. [2024-11-19 13:29:30,475 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1642 transitions. Word has length 189 [2024-11-19 13:29:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:30,475 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1642 transitions. [2024-11-19 13:29:30,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 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-19 13:29:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1642 transitions. [2024-11-19 13:29:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 13:29:30,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:30,477 INFO L215 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-19 13:29:30,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 13:29:30,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:30,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash 550054889, now seen corresponding path program 1 times [2024-11-19 13:29:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432508269] [2024-11-19 13:29:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:30,814 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-19 13:29:30,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:30,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432508269] [2024-11-19 13:29:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432508269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:30,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 13:29:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 13:29:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212153772] [2024-11-19 13:29:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:30,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 13:29:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:30,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 13:29:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 13:29:30,817 INFO L87 Difference]: Start difference. First operand 1206 states and 1642 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 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-19 13:29:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:31,234 INFO L93 Difference]: Finished difference Result 2305 states and 3148 transitions. [2024-11-19 13:29:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 13:29:31,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 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-19 13:29:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:31,239 INFO L225 Difference]: With dead ends: 2305 [2024-11-19 13:29:31,239 INFO L226 Difference]: Without dead ends: 1239 [2024-11-19 13:29:31,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 13:29:31,240 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 12 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2462 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 13:29:31,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2462 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 13:29:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-19 13:29:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1230. [2024-11-19 13:29:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1195 states have (on average 1.3548117154811716) internal successors, (1619), 1209 states have internal predecessors, (1619), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 13:29:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1675 transitions. [2024-11-19 13:29:31,263 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1675 transitions. Word has length 190 [2024-11-19 13:29:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:31,263 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1675 transitions. [2024-11-19 13:29:31,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 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-19 13:29:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1675 transitions. [2024-11-19 13:29:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 13:29:31,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:31,265 INFO L215 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-19 13:29:31,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 13:29:31,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1910520627, now seen corresponding path program 1 times [2024-11-19 13:29:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:31,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652123631] [2024-11-19 13:29:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:31,750 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-19 13:29:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:31,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652123631] [2024-11-19 13:29:31,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652123631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:29:31,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180348287] [2024-11-19 13:29:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:29:31,753 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-19 13:29:31,753 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-19 13:29:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:32,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 13:29:32,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:29:32,432 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-19 13:29:32,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 13:29:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180348287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 13:29:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 13:29:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-19 13:29:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863304351] [2024-11-19 13:29:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 13:29:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 13:29:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 13:29:32,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 13:29:32,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:29:32,434 INFO L87 Difference]: Start difference. First operand 1230 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-19 13:29:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 13:29:32,468 INFO L93 Difference]: Finished difference Result 2275 states and 3114 transitions. [2024-11-19 13:29:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 13:29:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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 190 [2024-11-19 13:29:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 13:29:32,472 INFO L225 Difference]: With dead ends: 2275 [2024-11-19 13:29:32,472 INFO L226 Difference]: Without dead ends: 1233 [2024-11-19 13:29:32,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 13:29:32,474 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1583 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-19 13:29:32,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1583 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 13:29:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2024-11-19 13:29:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2024-11-19 13:29:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1197 states have (on average 1.3550543024227235) internal successors, (1622), 1212 states have internal predecessors, (1622), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2024-11-19 13:29:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1684 transitions. [2024-11-19 13:29:32,492 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1684 transitions. Word has length 190 [2024-11-19 13:29:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 13:29:32,492 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1684 transitions. [2024-11-19 13:29:32,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-19 13:29:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1684 transitions. [2024-11-19 13:29:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-19 13:29:32,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 13:29:32,494 INFO L215 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] [2024-11-19 13:29:32,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 13:29:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:32,695 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-19 13:29:32,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 13:29:32,695 INFO L85 PathProgramCache]: Analyzing trace with hash -178802935, now seen corresponding path program 1 times [2024-11-19 13:29:32,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 13:29:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902807398] [2024-11-19 13:29:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 13:29:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:33,643 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-19 13:29:33,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 13:29:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902807398] [2024-11-19 13:29:33,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902807398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 13:29:33,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508277032] [2024-11-19 13:29:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 13:29:33,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 13:29:33,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 13:29:33,646 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-19 13:29:33,647 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-19 13:29:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 13:29:34,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-19 13:29:34,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 13:29:34,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 13:29:34,306 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-19 13:29:34,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-19 13:29:34,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-19 13:29:34,568 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 23 treesize of output 11 [2024-11-19 13:29:34,572 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 15 treesize of output 1 [2024-11-19 13:29:34,590 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-19 13:29:34,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-19 13:29:34,598 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-19 13:29:34,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 13:29:34,657 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 7 treesize of output 3 [2024-11-19 13:29:34,660 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 7 treesize of output 3 [2024-11-19 13:29:34,760 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 13:29:34,760 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-19 13:29:34,767 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 24 treesize of output 11 [2024-11-19 13:29:34,774 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 24 treesize of output 11 [2024-11-19 13:30:22,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 13:30:23,708 INFO L224 Elim1Store]: Index analysis took 937 ms