./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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 be1dcf4f68625d62d28b81607385317c3749a3b9c4401099e862ce9a8a6e6751 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 21:28:42,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 21:28:42,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-20 21:28:42,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 21:28:42,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 21:28:43,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 21:28:43,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 21:28:43,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 21:28:43,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 21:28:43,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 21:28:43,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 21:28:43,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 21:28:43,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 21:28:43,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 21:28:43,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 21:28:43,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 21:28:43,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 21:28:43,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 21:28:43,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 21:28:43,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 21:28:43,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 21:28:43,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 21:28:43,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 21:28:43,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 21:28:43,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 21:28:43,021 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-20 21:28:43,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 21:28:43,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 21:28:43,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 21:28:43,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 21:28:43,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 21:28:43,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 21:28:43,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 21:28:43,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 21:28:43,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:28:43,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 21:28:43,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 21:28:43,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 21:28:43,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 21:28:43,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 21:28:43,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 21:28:43,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 21:28:43,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 21:28:43,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 21:28:43,026 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 -> be1dcf4f68625d62d28b81607385317c3749a3b9c4401099e862ce9a8a6e6751 [2024-11-20 21:28:43,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 21:28:43,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 21:28:43,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 21:28:43,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 21:28:43,293 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 21:28:43,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i [2024-11-20 21:28:44,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 21:28:45,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 21:28:45,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test4-1.i [2024-11-20 21:28:45,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44da7fcfa/153f7cd4f3364bb59b02a90b883addd4/FLAG1aff14578 [2024-11-20 21:28:45,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44da7fcfa/153f7cd4f3364bb59b02a90b883addd4 [2024-11-20 21:28:45,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 21:28:45,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 21:28:45,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 21:28:45,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 21:28:45,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 21:28:45,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:28:45" (1/1) ... [2024-11-20 21:28:45,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d9d76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:45, skipping insertion in model container [2024-11-20 21:28:45,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:28:45" (1/1) ... [2024-11-20 21:28:45,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 21:28:45,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:28:45,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 21:28:46,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 21:28:46,141 INFO L204 MainTranslator]: Completed translation [2024-11-20 21:28:46,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46 WrapperNode [2024-11-20 21:28:46,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 21:28:46,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 21:28:46,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 21:28:46,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 21:28:46,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,277 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1597 [2024-11-20 21:28:46,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 21:28:46,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 21:28:46,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 21:28:46,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 21:28:46,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,308 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,400 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [307, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 82 writes are split as follows [82, 0]. [2024-11-20 21:28:46,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 21:28:46,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 21:28:46,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 21:28:46,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 21:28:46,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (1/1) ... [2024-11-20 21:28:46,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 21:28:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:28:46,553 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-20 21:28:46,556 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-20 21:28:46,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 21:28:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 21:28:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 21:28:46,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 21:28:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 21:28:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 21:28:46,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 21:28:46,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 21:28:46,612 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 21:28:46,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 21:28:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 21:28:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 21:28:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 21:28:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 21:28:46,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 21:28:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 21:28:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 21:28:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 21:28:46,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 21:28:46,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 21:28:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 21:28:46,862 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 21:28:46,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 21:28:48,380 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-20 21:28:48,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 21:28:48,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 21:28:48,409 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-20 21:28:48,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:28:48 BoogieIcfgContainer [2024-11-20 21:28:48,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 21:28:48,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 21:28:48,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 21:28:48,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 21:28:48,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:28:45" (1/3) ... [2024-11-20 21:28:48,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbe09c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:28:48, skipping insertion in model container [2024-11-20 21:28:48,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:28:46" (2/3) ... [2024-11-20 21:28:48,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbe09c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:28:48, skipping insertion in model container [2024-11-20 21:28:48,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:28:48" (3/3) ... [2024-11-20 21:28:48,422 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test4-1.i [2024-11-20 21:28:48,440 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 21:28:48,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-20 21:28:48,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 21:28:48,539 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;@da3a73d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 21:28:48,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-20 21:28:48,548 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-20 21:28:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 21:28:48,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:48,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 21:28:48,556 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-20 21:28:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1408033094, now seen corresponding path program 1 times [2024-11-20 21:28:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111571220] [2024-11-20 21:28:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:48,778 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-20 21:28:48,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:48,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111571220] [2024-11-20 21:28:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111571220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:48,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:48,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 21:28:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665800923] [2024-11-20 21:28:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:48,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 21:28:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 21:28:48,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 21:28:48,838 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-20 21:28:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:48,914 INFO L93 Difference]: Finished difference Result 870 states and 1407 transitions. [2024-11-20 21:28:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 21:28:48,917 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-20 21:28:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:48,930 INFO L225 Difference]: With dead ends: 870 [2024-11-20 21:28:48,930 INFO L226 Difference]: Without dead ends: 430 [2024-11-20 21:28:48,936 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-20 21:28:48,940 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-20 21:28:48,942 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-20 21:28:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-20 21:28:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-20 21:28:49,008 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-20 21:28:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions. [2024-11-20 21:28:49,020 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 6 [2024-11-20 21:28:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:49,022 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 624 transitions. [2024-11-20 21:28:49,022 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-20 21:28:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions. [2024-11-20 21:28:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 21:28:49,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:49,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 21:28:49,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 21:28:49,024 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-20 21:28:49,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1364389279, now seen corresponding path program 1 times [2024-11-20 21:28:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328889643] [2024-11-20 21:28:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:49,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:49,125 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-20 21:28:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:49,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328889643] [2024-11-20 21:28:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328889643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:49,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:28:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979614097] [2024-11-20 21:28:49,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:49,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:28:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:28:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:28:49,131 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-20 21:28:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:49,237 INFO L93 Difference]: Finished difference Result 850 states and 1238 transitions. [2024-11-20 21:28:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:28:49,238 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-20 21:28:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:49,245 INFO L225 Difference]: With dead ends: 850 [2024-11-20 21:28:49,246 INFO L226 Difference]: Without dead ends: 816 [2024-11-20 21:28:49,247 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-20 21:28:49,248 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-20 21:28:49,249 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-20 21:28:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-20 21:28:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 435. [2024-11-20 21:28:49,289 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-20 21:28:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 629 transitions. [2024-11-20 21:28:49,292 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 629 transitions. Word has length 6 [2024-11-20 21:28:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:49,293 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 629 transitions. [2024-11-20 21:28:49,293 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-20 21:28:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 629 transitions. [2024-11-20 21:28:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 21:28:49,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:49,304 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-20 21:28:49,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 21:28:49,304 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-20 21:28:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash -220519858, now seen corresponding path program 1 times [2024-11-20 21:28:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668331375] [2024-11-20 21:28:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:50,103 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-20 21:28:50,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668331375] [2024-11-20 21:28:50,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668331375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:50,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:28:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208972714] [2024-11-20 21:28:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:28:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:28:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:28:50,109 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-20 21:28:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:50,223 INFO L93 Difference]: Finished difference Result 866 states and 1254 transitions. [2024-11-20 21:28:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:28:50,223 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-20 21:28:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:50,227 INFO L225 Difference]: With dead ends: 866 [2024-11-20 21:28:50,228 INFO L226 Difference]: Without dead ends: 438 [2024-11-20 21:28:50,230 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-20 21:28:50,231 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 87 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-20 21:28:50,232 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-20 21:28:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-20 21:28:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2024-11-20 21:28:50,251 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-20 21:28:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 622 transitions. [2024-11-20 21:28:50,254 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 622 transitions. Word has length 151 [2024-11-20 21:28:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 622 transitions. [2024-11-20 21:28:50,255 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-20 21:28:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 622 transitions. [2024-11-20 21:28:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 21:28:50,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:50,262 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-20 21:28:50,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 21:28:50,263 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-20 21:28:50,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -315882022, now seen corresponding path program 1 times [2024-11-20 21:28:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144873115] [2024-11-20 21:28:50,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:50,591 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-20 21:28:50,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:50,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144873115] [2024-11-20 21:28:50,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144873115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:50,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:50,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:28:50,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006050800] [2024-11-20 21:28:50,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:50,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:28:50,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:50,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:28:50,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:28:50,597 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-20 21:28:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:50,654 INFO L93 Difference]: Finished difference Result 869 states and 1246 transitions. [2024-11-20 21:28:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:28:50,654 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-20 21:28:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:50,657 INFO L225 Difference]: With dead ends: 869 [2024-11-20 21:28:50,657 INFO L226 Difference]: Without dead ends: 441 [2024-11-20 21:28:50,658 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-20 21:28:50,660 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-20 21:28:50,661 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-20 21:28:50,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-20 21:28:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-20 21:28:50,676 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-20 21:28:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-20 21:28:50,681 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 151 [2024-11-20 21:28:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:50,681 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-20 21:28:50,681 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-20 21:28:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-20 21:28:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 21:28:50,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:50,685 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-20 21:28:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 21:28:50,687 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-20 21:28:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -803929128, now seen corresponding path program 1 times [2024-11-20 21:28:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916333998] [2024-11-20 21:28:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:50,961 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-20 21:28:50,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:50,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916333998] [2024-11-20 21:28:50,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916333998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:50,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:50,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 21:28:50,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993669416] [2024-11-20 21:28:50,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:50,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 21:28:50,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:50,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 21:28:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 21:28:50,967 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-20 21:28:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:51,028 INFO L93 Difference]: Finished difference Result 1008 states and 1442 transitions. [2024-11-20 21:28:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 21:28:51,030 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-20 21:28:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:51,033 INFO L225 Difference]: With dead ends: 1008 [2024-11-20 21:28:51,034 INFO L226 Difference]: Without dead ends: 574 [2024-11-20 21:28:51,035 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-20 21:28:51,038 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-20 21:28:51,039 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-20 21:28:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-20 21:28:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-11-20 21:28:51,056 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-20 21:28:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 820 transitions. [2024-11-20 21:28:51,059 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 820 transitions. Word has length 151 [2024-11-20 21:28:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:51,059 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 820 transitions. [2024-11-20 21:28:51,060 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-20 21:28:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 820 transitions. [2024-11-20 21:28:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-20 21:28:51,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:51,062 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-20 21:28:51,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 21:28:51,063 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-20 21:28:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash -209873303, now seen corresponding path program 1 times [2024-11-20 21:28:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313452309] [2024-11-20 21:28:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 21:28:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 21:28:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:51,493 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-20 21:28:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:51,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313452309] [2024-11-20 21:28:51,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313452309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:51,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:51,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:28:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190187523] [2024-11-20 21:28:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:28:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:28:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:28:51,500 INFO L87 Difference]: Start difference. First operand 574 states and 820 transitions. Second operand has 5 states, 5 states have (on average 31.8) 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-20 21:28:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:51,997 INFO L93 Difference]: Finished difference Result 969 states and 1384 transitions. [2024-11-20 21:28:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:28:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) 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-20 21:28:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:52,003 INFO L225 Difference]: With dead ends: 969 [2024-11-20 21:28:52,003 INFO L226 Difference]: Without dead ends: 535 [2024-11-20 21:28:52,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:28:52,006 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 36 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 21:28:52,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1893 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 21:28:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-20 21:28:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 532. [2024-11-20 21:28:52,023 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-20 21:28:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 743 transitions. [2024-11-20 21:28:52,027 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 743 transitions. Word has length 166 [2024-11-20 21:28:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:52,027 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 743 transitions. [2024-11-20 21:28:52,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) 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-20 21:28:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 743 transitions. [2024-11-20 21:28:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-20 21:28:52,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:52,030 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-20 21:28:52,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 21:28:52,030 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-20 21:28:52,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1367599453, now seen corresponding path program 1 times [2024-11-20 21:28:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:52,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506131855] [2024-11-20 21:28:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 21:28:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 21:28:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:52,328 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-20 21:28:52,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:52,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506131855] [2024-11-20 21:28:52,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506131855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:52,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:52,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 21:28:52,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176736807] [2024-11-20 21:28:52,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:52,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:28:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:52,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:28:52,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 21:28:52,331 INFO L87 Difference]: Start difference. First operand 532 states and 743 transitions. Second operand has 4 states, 4 states have (on average 39.75) 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-20 21:28:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:52,735 INFO L93 Difference]: Finished difference Result 1073 states and 1497 transitions. [2024-11-20 21:28:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:28:52,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) 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-20 21:28:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:52,739 INFO L225 Difference]: With dead ends: 1073 [2024-11-20 21:28:52,739 INFO L226 Difference]: Without dead ends: 681 [2024-11-20 21:28:52,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 21:28:52,741 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 249 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 21:28:52,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1458 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 21:28:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-20 21:28:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 678. [2024-11-20 21:28:52,758 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-20 21:28:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 940 transitions. [2024-11-20 21:28:52,761 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 940 transitions. Word has length 166 [2024-11-20 21:28:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:52,762 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 940 transitions. [2024-11-20 21:28:52,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) 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-20 21:28:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 940 transitions. [2024-11-20 21:28:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-20 21:28:52,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:52,764 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-20 21:28:52,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 21:28:52,764 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-20 21:28:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -35771274, now seen corresponding path program 1 times [2024-11-20 21:28:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215578611] [2024-11-20 21:28:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 21:28:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 21:28:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 21:28:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 21:28:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:53,226 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-20 21:28:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215578611] [2024-11-20 21:28:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215578611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:28:53,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 21:28:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144156888] [2024-11-20 21:28:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:28:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:28:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:28:53,229 INFO L87 Difference]: Start difference. First operand 678 states and 940 transitions. Second operand has 5 states, 4 states have (on average 41.0) 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-20 21:28:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:53,699 INFO L93 Difference]: Finished difference Result 747 states and 1041 transitions. [2024-11-20 21:28:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 21:28:53,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.0) 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-20 21:28:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:53,704 INFO L225 Difference]: With dead ends: 747 [2024-11-20 21:28:53,704 INFO L226 Difference]: Without dead ends: 745 [2024-11-20 21:28:53,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:28:53,705 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 301 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 21:28:53,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1956 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 21:28:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-20 21:28:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 742. [2024-11-20 21:28:53,722 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-20 21:28:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1024 transitions. [2024-11-20 21:28:53,725 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1024 transitions. Word has length 181 [2024-11-20 21:28:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:53,726 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1024 transitions. [2024-11-20 21:28:53,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.0) 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-20 21:28:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1024 transitions. [2024-11-20 21:28:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 21:28:53,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:53,728 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-20 21:28:53,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 21:28:53,729 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-20 21:28:53,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash 791285140, now seen corresponding path program 1 times [2024-11-20 21:28:53,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:53,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582212150] [2024-11-20 21:28:53,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 21:28:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 21:28:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 21:28:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 21:28:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:54,179 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-20 21:28:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:54,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582212150] [2024-11-20 21:28:54,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582212150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:28:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122495082] [2024-11-20 21:28:54,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:54,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:28:54,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:28:54,182 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-20 21:28:54,185 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-20 21:28:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:54,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 21:28:54,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:28:54,943 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-20 21:28:54,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 21:28:55,210 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-20 21:28:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122495082] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 21:28:55,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 21:28:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-20 21:28:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762045023] [2024-11-20 21:28:55,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 21:28:55,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 21:28:55,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:55,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 21:28:55,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-20 21:28:55,213 INFO L87 Difference]: Start difference. First operand 742 states and 1024 transitions. Second operand has 11 states, 11 states have (on average 44.81818181818182) internal successors, (493), 10 states have internal predecessors, (493), 3 states have call successors, (12), 2 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-20 21:28:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:28:55,754 INFO L93 Difference]: Finished difference Result 1132 states and 1587 transitions. [2024-11-20 21:28:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:28:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 44.81818181818182) internal successors, (493), 10 states have internal predecessors, (493), 3 states have call successors, (12), 2 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-20 21:28:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:28:55,760 INFO L225 Difference]: With dead ends: 1132 [2024-11-20 21:28:55,760 INFO L226 Difference]: Without dead ends: 1098 [2024-11-20 21:28:55,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-20 21:28:55,761 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 1808 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 3414 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 21:28:55,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 3414 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 21:28:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-20 21:28:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1095. [2024-11-20 21:28:55,785 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-20 21:28:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1511 transitions. [2024-11-20 21:28:55,789 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1511 transitions. Word has length 186 [2024-11-20 21:28:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:28:55,790 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1511 transitions. [2024-11-20 21:28:55,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 44.81818181818182) internal successors, (493), 10 states have internal predecessors, (493), 3 states have call successors, (12), 2 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-20 21:28:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1511 transitions. [2024-11-20 21:28:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 21:28:55,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:28:55,792 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-20 21:28:55,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 21:28:55,996 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-20 21:28:55,997 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-20 21:28:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:28:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1283066459, now seen corresponding path program 1 times [2024-11-20 21:28:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:28:55,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893606665] [2024-11-20 21:28:55,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:28:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 21:28:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 21:28:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 21:28:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 21:28:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:57,070 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-20 21:28:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:28:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893606665] [2024-11-20 21:28:57,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893606665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:28:57,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238292090] [2024-11-20 21:28:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:28:57,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:28:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:28:57,073 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-20 21:28:57,075 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-20 21:28:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:28:57,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 21:28:57,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:28:57,738 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-20 21:28:57,769 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 21 treesize of output 20 [2024-11-20 21:28:58,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 21:28:58,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 41 [2024-11-20 21:28:58,549 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-20 21:28:58,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:28:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238292090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:28:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:28:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-20 21:28:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748933621] [2024-11-20 21:28:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:28:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 21:28:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:28:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 21:28:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-20 21:28:58,552 INFO L87 Difference]: Start difference. First operand 1095 states and 1511 transitions. Second operand has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 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-20 21:29:02,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-20 21:29:06,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-20 21:29:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:08,802 INFO L93 Difference]: Finished difference Result 2138 states and 2943 transitions. [2024-11-20 21:29:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 21:29:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 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-20 21:29:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:08,809 INFO L225 Difference]: With dead ends: 2138 [2024-11-20 21:29:08,809 INFO L226 Difference]: Without dead ends: 1136 [2024-11-20 21:29:08,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2024-11-20 21:29:08,812 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 948 mSDsluCounter, 3470 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 3986 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:08,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 3986 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1668 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2024-11-20 21:29:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2024-11-20 21:29:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1127. [2024-11-20 21:29:08,836 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-20 21:29:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1548 transitions. [2024-11-20 21:29:08,868 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1548 transitions. Word has length 187 [2024-11-20 21:29:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:08,868 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1548 transitions. [2024-11-20 21:29:08,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.166666666666666) internal successors, (170), 12 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-20 21:29:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1548 transitions. [2024-11-20 21:29:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 21:29:08,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:08,871 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-20 21:29:08,884 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-20 21:29:09,071 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-20 21:29:09,072 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-20 21:29:09,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash 120802727, now seen corresponding path program 1 times [2024-11-20 21:29:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:09,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565611567] [2024-11-20 21:29:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 21:29:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:09,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 21:29:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 21:29:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:09,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 21:29:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:09,318 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-20 21:29:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565611567] [2024-11-20 21:29:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565611567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:09,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:29:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 21:29:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784407508] [2024-11-20 21:29:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 21:29:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:09,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 21:29:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 21:29:09,321 INFO L87 Difference]: Start difference. First operand 1127 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 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-20 21:29:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:09,959 INFO L93 Difference]: Finished difference Result 2030 states and 2792 transitions. [2024-11-20 21:29:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 21:29:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 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-20 21:29:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:09,964 INFO L225 Difference]: With dead ends: 2030 [2024-11-20 21:29:09,965 INFO L226 Difference]: Without dead ends: 936 [2024-11-20 21:29:09,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 21:29:09,967 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 15 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:09,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1590 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 21:29:09,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-11-20 21:29:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 933. [2024-11-20 21:29:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 898 states have (on average 1.3318485523385302) internal successors, (1196), 912 states have internal predecessors, (1196), 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-20 21:29:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1252 transitions. [2024-11-20 21:29:09,996 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1252 transitions. Word has length 187 [2024-11-20 21:29:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:09,997 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1252 transitions. [2024-11-20 21:29:09,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 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-20 21:29:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1252 transitions. [2024-11-20 21:29:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 21:29:09,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:09,999 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-20 21:29:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 21:29:10,000 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-20 21:29:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1048759248, now seen corresponding path program 1 times [2024-11-20 21:29:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916321168] [2024-11-20 21:29:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 21:29:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:10,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 21:29:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 21:29:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:10,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 21:29:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:10,864 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-20 21:29:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916321168] [2024-11-20 21:29:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916321168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:29:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597678640] [2024-11-20 21:29:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:29:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:29:10,867 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-20 21:29:10,869 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-20 21:29:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:11,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 21:29:11,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:29:11,559 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-20 21:29:11,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:29:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597678640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:29:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-20 21:29:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525115883] [2024-11-20 21:29:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:11,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 21:29:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:11,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 21:29:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:29:11,568 INFO L87 Difference]: Start difference. First operand 933 states and 1252 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-20 21:29:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:11,783 INFO L93 Difference]: Finished difference Result 1827 states and 2463 transitions. [2024-11-20 21:29:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 21:29:11,783 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-20 21:29:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:11,788 INFO L225 Difference]: With dead ends: 1827 [2024-11-20 21:29:11,789 INFO L226 Difference]: Without dead ends: 933 [2024-11-20 21:29:11,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 193 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-20 21:29:11,791 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 13 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:11,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1207 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 21:29:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-20 21:29:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2024-11-20 21:29:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 898 states have (on average 1.3285077951002227) internal successors, (1193), 912 states have internal predecessors, (1193), 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-20 21:29:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1249 transitions. [2024-11-20 21:29:11,817 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1249 transitions. Word has length 188 [2024-11-20 21:29:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:11,818 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1249 transitions. [2024-11-20 21:29:11,818 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-20 21:29:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1249 transitions. [2024-11-20 21:29:11,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 21:29:11,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:11,821 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-20 21:29:11,834 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-20 21:29:12,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:29:12,023 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-20 21:29:12,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1934302880, now seen corresponding path program 1 times [2024-11-20 21:29:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400221739] [2024-11-20 21:29:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-20 21:29:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:12,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 21:29:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:12,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 21:29:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 21:29:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:12,546 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-20 21:29:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400221739] [2024-11-20 21:29:12,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400221739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:12,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:29:12,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 21:29:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260774493] [2024-11-20 21:29:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:12,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:29:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:29:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:29:12,551 INFO L87 Difference]: Start difference. First operand 933 states and 1249 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) 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-20 21:29:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:13,419 INFO L93 Difference]: Finished difference Result 1836 states and 2489 transitions. [2024-11-20 21:29:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 21:29:13,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) 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-20 21:29:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:13,424 INFO L225 Difference]: With dead ends: 1836 [2024-11-20 21:29:13,424 INFO L226 Difference]: Without dead ends: 945 [2024-11-20 21:29:13,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 21:29:13,426 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 10 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:13,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1853 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 21:29:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2024-11-20 21:29:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 942. [2024-11-20 21:29:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 907 states have (on average 1.3252480705622933) internal successors, (1202), 921 states have internal predecessors, (1202), 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-20 21:29:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1258 transitions. [2024-11-20 21:29:13,453 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1258 transitions. Word has length 189 [2024-11-20 21:29:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1258 transitions. [2024-11-20 21:29:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) 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-20 21:29:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1258 transitions. [2024-11-20 21:29:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 21:29:13,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:13,455 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-20 21:29:13,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 21:29:13,456 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-20 21:29:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1685724649, now seen corresponding path program 1 times [2024-11-20 21:29:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493934907] [2024-11-20 21:29:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 21:29:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 21:29:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 21:29:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 21:29:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:13,971 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-20 21:29:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493934907] [2024-11-20 21:29:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493934907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:29:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 21:29:13,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349946483] [2024-11-20 21:29:13,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:13,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:29:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:13,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:29:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:29:13,974 INFO L87 Difference]: Start difference. First operand 942 states and 1258 transitions. Second operand has 8 states, 8 states have (on average 21.625) 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-20 21:29:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:14,913 INFO L93 Difference]: Finished difference Result 1850 states and 2502 transitions. [2024-11-20 21:29:14,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:29:14,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) 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-20 21:29:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:14,918 INFO L225 Difference]: With dead ends: 1850 [2024-11-20 21:29:14,918 INFO L226 Difference]: Without dead ends: 960 [2024-11-20 21:29:14,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 21:29:14,920 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 14 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:14,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2526 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 21:29:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-20 21:29:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 954. [2024-11-20 21:29:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 919 states have (on average 1.3242655059847661) internal successors, (1217), 933 states have internal predecessors, (1217), 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-20 21:29:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1273 transitions. [2024-11-20 21:29:14,946 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1273 transitions. Word has length 190 [2024-11-20 21:29:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:14,946 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1273 transitions. [2024-11-20 21:29:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) 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-20 21:29:14,946 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1273 transitions. [2024-11-20 21:29:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 21:29:14,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:14,948 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-20 21:29:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 21:29:14,948 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-20 21:29:14,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -774850867, now seen corresponding path program 1 times [2024-11-20 21:29:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322744796] [2024-11-20 21:29:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 21:29:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 21:29:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 21:29:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-20 21:29:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:15,881 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-20 21:29:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322744796] [2024-11-20 21:29:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322744796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:29:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548687882] [2024-11-20 21:29:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:15,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:29:15,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:29:15,885 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-20 21:29:15,886 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-20 21:29:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:16,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 21:29:16,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:29:17,048 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-20 21:29:17,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:29:17,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548687882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:17,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:29:17,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-20 21:29:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304317669] [2024-11-20 21:29:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:17,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 21:29:17,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 21:29:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:29:17,052 INFO L87 Difference]: Start difference. First operand 954 states and 1273 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-20 21:29:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:17,734 INFO L93 Difference]: Finished difference Result 1867 states and 2506 transitions. [2024-11-20 21:29:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 21:29:17,735 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-20 21:29:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:17,739 INFO L225 Difference]: With dead ends: 1867 [2024-11-20 21:29:17,739 INFO L226 Difference]: Without dead ends: 969 [2024-11-20 21:29:17,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:29:17,741 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 8 mSDsluCounter, 1850 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:17,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2289 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 21:29:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-20 21:29:17,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 954. [2024-11-20 21:29:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 919 states have (on average 1.3242655059847661) internal successors, (1217), 933 states have internal predecessors, (1217), 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-20 21:29:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1273 transitions. [2024-11-20 21:29:17,766 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1273 transitions. Word has length 190 [2024-11-20 21:29:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:17,767 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1273 transitions. [2024-11-20 21:29:17,767 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-20 21:29:17,767 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1273 transitions. [2024-11-20 21:29:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 21:29:17,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:17,769 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, 1] [2024-11-20 21:29:17,785 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-20 21:29:17,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 21:29:17,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 21:29:17,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash 773014932, now seen corresponding path program 1 times [2024-11-20 21:29:17,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:17,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663697381] [2024-11-20 21:29:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 21:29:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:18,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 21:29:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-20 21:29:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 21:29:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:18,617 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-20 21:29:18,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:18,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663697381] [2024-11-20 21:29:18,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663697381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:18,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:29:18,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 21:29:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542432754] [2024-11-20 21:29:18,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:18,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 21:29:18,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:18,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 21:29:18,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:29:18,620 INFO L87 Difference]: Start difference. First operand 954 states and 1273 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 9 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 21:29:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:19,844 INFO L93 Difference]: Finished difference Result 1880 states and 2537 transitions. [2024-11-20 21:29:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 21:29:19,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 9 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-11-20 21:29:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:19,849 INFO L225 Difference]: With dead ends: 1880 [2024-11-20 21:29:19,849 INFO L226 Difference]: Without dead ends: 987 [2024-11-20 21:29:19,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-20 21:29:19,851 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 22 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:19,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2972 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 21:29:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-20 21:29:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 975. [2024-11-20 21:29:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 940 states have (on average 1.323404255319149) internal successors, (1244), 954 states have internal predecessors, (1244), 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-20 21:29:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1300 transitions. [2024-11-20 21:29:19,875 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1300 transitions. Word has length 191 [2024-11-20 21:29:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:19,876 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1300 transitions. [2024-11-20 21:29:19,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 9 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 21:29:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1300 transitions. [2024-11-20 21:29:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-20 21:29:19,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:19,878 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, 1] [2024-11-20 21:29:19,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 21:29:19,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 21:29:19,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1804585264, now seen corresponding path program 1 times [2024-11-20 21:29:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950709217] [2024-11-20 21:29:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:19,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:20,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 21:29:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:20,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 21:29:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-20 21:29:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 21:29:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:20,824 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-20 21:29:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950709217] [2024-11-20 21:29:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950709217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:29:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119391870] [2024-11-20 21:29:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:29:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:29:20,827 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-20 21:29:20,829 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-20 21:29:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:21,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 21:29:21,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:29:21,713 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-20 21:29:21,714 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 21:29:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119391870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:21,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 21:29:21,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-11-20 21:29:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187863889] [2024-11-20 21:29:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:21,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 21:29:21,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:21,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 21:29:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 21:29:21,716 INFO L87 Difference]: Start difference. First operand 975 states and 1300 transitions. Second operand has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 21:29:23,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:23,022 INFO L93 Difference]: Finished difference Result 1912 states and 2561 transitions. [2024-11-20 21:29:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 21:29:23,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 191 [2024-11-20 21:29:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:23,028 INFO L225 Difference]: With dead ends: 1912 [2024-11-20 21:29:23,028 INFO L226 Difference]: Without dead ends: 1005 [2024-11-20 21:29:23,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 21:29:23,030 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 13 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:23,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2686 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 21:29:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-11-20 21:29:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 990. [2024-11-20 21:29:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 955 states have (on average 1.3214659685863874) internal successors, (1262), 969 states have internal predecessors, (1262), 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-20 21:29:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1318 transitions. [2024-11-20 21:29:23,052 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1318 transitions. Word has length 191 [2024-11-20 21:29:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:23,052 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1318 transitions. [2024-11-20 21:29:23,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.75) internal successors, (174), 8 states have internal predecessors, (174), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 21:29:23,053 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1318 transitions. [2024-11-20 21:29:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 21:29:23,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:23,054 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, 1, 1] [2024-11-20 21:29:23,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 21:29:23,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 21:29:23,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 21:29:23,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1940415651, now seen corresponding path program 1 times [2024-11-20 21:29:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905278267] [2024-11-20 21:29:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 21:29:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:23,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 21:29:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 21:29:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 21:29:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:23,909 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-20 21:29:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905278267] [2024-11-20 21:29:23,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905278267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 21:29:23,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 21:29:23,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 21:29:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712430665] [2024-11-20 21:29:23,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 21:29:23,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 21:29:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 21:29:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 21:29:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 21:29:23,912 INFO L87 Difference]: Start difference. First operand 990 states and 1318 transitions. Second operand has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 21:29:24,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 21:29:24,951 INFO L93 Difference]: Finished difference Result 1942 states and 2618 transitions. [2024-11-20 21:29:24,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 21:29:24,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 192 [2024-11-20 21:29:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 21:29:24,956 INFO L225 Difference]: With dead ends: 1942 [2024-11-20 21:29:24,957 INFO L226 Difference]: Without dead ends: 1020 [2024-11-20 21:29:24,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-20 21:29:24,959 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 28 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2964 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 21:29:24,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2964 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 21:29:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-20 21:29:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 999. [2024-11-20 21:29:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 964 states have (on average 1.3184647302904564) internal successors, (1271), 978 states have internal predecessors, (1271), 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-20 21:29:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1327 transitions. [2024-11-20 21:29:24,980 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1327 transitions. Word has length 192 [2024-11-20 21:29:24,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 21:29:24,981 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1327 transitions. [2024-11-20 21:29:24,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.909090909090908) internal successors, (175), 10 states have internal predecessors, (175), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-20 21:29:24,981 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1327 transitions. [2024-11-20 21:29:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 21:29:24,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 21:29:24,983 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, 1, 1] [2024-11-20 21:29:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 21:29:24,983 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-20 21:29:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 21:29:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash -26506431, now seen corresponding path program 1 times [2024-11-20 21:29:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 21:29:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156841163] [2024-11-20 21:29:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 21:29:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 21:29:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 21:29:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 21:29:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-20 21:29:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:25,817 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-20 21:29:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 21:29:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156841163] [2024-11-20 21:29:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156841163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 21:29:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884818975] [2024-11-20 21:29:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 21:29:25,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 21:29:25,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 21:29:25,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 21:29:25,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 21:29:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 21:29:26,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 21:29:26,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 21:29:55,937 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)