./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:20:32,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:20:32,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:20:32,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:20:32,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:20:32,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:20:32,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:20:32,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:20:32,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:20:32,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:20:32,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:20:32,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:20:32,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:20:32,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:20:32,627 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:20:32,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:20:32,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:20:32,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:20:32,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:20:32,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:20:32,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:20:32,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:20:32,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:20:32,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:20:32,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:20:32,632 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:20:32,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:20:32,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:20:32,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:20:32,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:20:32,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:20:32,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:20:32,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:20:32,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:20:32,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:20:32,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:20:32,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:20:32,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:20:32,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:20:32,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:20:32,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:20:32,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:20:32,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:20:32,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:20:32,637 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 -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2024-11-12 20:20:32,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:20:32,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:20:32,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:20:32,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:20:32,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:20:32,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2024-11-12 20:20:34,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:20:34,639 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:20:34,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2024-11-12 20:20:34,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afcb9919/ba125e6aaf3443beb67adf2941246bfa/FLAG6a9b48ba9 [2024-11-12 20:20:34,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3afcb9919/ba125e6aaf3443beb67adf2941246bfa [2024-11-12 20:20:34,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:20:34,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:20:34,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:20:34,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:20:34,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:20:34,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:20:34" (1/1) ... [2024-11-12 20:20:34,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444b2199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:34, skipping insertion in model container [2024-11-12 20:20:34,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:20:34" (1/1) ... [2024-11-12 20:20:34,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:20:35,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:20:35,357 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:20:35,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:20:35,527 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:20:35,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35 WrapperNode [2024-11-12 20:20:35,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:20:35,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:20:35,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:20:35,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:20:35,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,647 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1597 [2024-11-12 20:20:35,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:20:35,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:20:35,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:20:35,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:20:35,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,809 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-12 20:20:35,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:20:35,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:20:35,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:20:35,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:20:35,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (1/1) ... [2024-11-12 20:20:35,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:20:35,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:35,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 20:20:35,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 20:20:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:20:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:20:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 20:20:36,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 20:20:36,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:20:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:20:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:20:36,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:20:36,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:20:36,077 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:20:36,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:20:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:20:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:20:36,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:20:36,277 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:20:36,279 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:20:37,798 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-12 20:20:37,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:20:37,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:20:37,829 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-12 20:20:37,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:20:37 BoogieIcfgContainer [2024-11-12 20:20:37,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:20:37,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:20:37,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:20:37,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:20:37,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:20:34" (1/3) ... [2024-11-12 20:20:37,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd8d4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:20:37, skipping insertion in model container [2024-11-12 20:20:37,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:20:35" (2/3) ... [2024-11-12 20:20:37,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd8d4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:20:37, skipping insertion in model container [2024-11-12 20:20:37,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:20:37" (3/3) ... [2024-11-12 20:20:37,839 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2024-11-12 20:20:37,855 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:20:37,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-12 20:20:37,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:20:37,944 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;@61db2d34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:20:37,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 20:20:37,950 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-12 20:20:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 20:20:37,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:37,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:20:37,957 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-12 20:20:37,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:37,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1408033094, now seen corresponding path program 1 times [2024-11-12 20:20:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885217327] [2024-11-12 20:20:37,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:20:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:38,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885217327] [2024-11-12 20:20:38,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885217327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:38,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:38,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:20:38,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515865505] [2024-11-12 20:20:38,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:38,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:20:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:38,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:20:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:20:38,155 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-12 20:20:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:38,239 INFO L93 Difference]: Finished difference Result 870 states and 1407 transitions. [2024-11-12 20:20:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:20:38,242 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-12 20:20:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:38,258 INFO L225 Difference]: With dead ends: 870 [2024-11-12 20:20:38,258 INFO L226 Difference]: Without dead ends: 430 [2024-11-12 20:20:38,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:20:38,271 INFO L435 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-12 20:20:38,273 INFO L436 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-12 20:20:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-12 20:20:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2024-11-12 20:20:38,350 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-12 20:20:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 624 transitions. [2024-11-12 20:20:38,356 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 624 transitions. Word has length 6 [2024-11-12 20:20:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:38,357 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 624 transitions. [2024-11-12 20:20:38,357 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-12 20:20:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 624 transitions. [2024-11-12 20:20:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 20:20:38,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:38,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 20:20:38,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:20:38,358 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-12 20:20:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:38,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1364389279, now seen corresponding path program 1 times [2024-11-12 20:20:38,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:38,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130020099] [2024-11-12 20:20:38,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:20:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130020099] [2024-11-12 20:20:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130020099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:38,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:38,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:20:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859059246] [2024-11-12 20:20:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:20:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:20:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:20:38,502 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-12 20:20:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:38,638 INFO L93 Difference]: Finished difference Result 850 states and 1238 transitions. [2024-11-12 20:20:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:20:38,639 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-12 20:20:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:38,645 INFO L225 Difference]: With dead ends: 850 [2024-11-12 20:20:38,646 INFO L226 Difference]: Without dead ends: 816 [2024-11-12 20:20:38,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:20:38,649 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 547 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:38,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1282 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:20:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-12 20:20:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 435. [2024-11-12 20:20:38,687 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-12 20:20:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 629 transitions. [2024-11-12 20:20:38,691 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 629 transitions. Word has length 6 [2024-11-12 20:20:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:38,693 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 629 transitions. [2024-11-12 20:20:38,694 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-12 20:20:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 629 transitions. [2024-11-12 20:20:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 20:20:38,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:38,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:38,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 20:20:38,705 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-12 20:20:38,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash -220519858, now seen corresponding path program 1 times [2024-11-12 20:20:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977448080] [2024-11-12 20:20:38,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:20:39,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:39,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977448080] [2024-11-12 20:20:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977448080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:39,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:20:39,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701812596] [2024-11-12 20:20:39,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:39,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:20:39,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:20:39,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:20:39,411 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-12 20:20:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:39,541 INFO L93 Difference]: Finished difference Result 866 states and 1254 transitions. [2024-11-12 20:20:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:39,546 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-12 20:20:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:39,548 INFO L225 Difference]: With dead ends: 866 [2024-11-12 20:20:39,548 INFO L226 Difference]: Without dead ends: 438 [2024-11-12 20:20:39,550 INFO L434 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-12 20:20:39,551 INFO L435 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-12 20:20:39,552 INFO L436 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-12 20:20:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-12 20:20:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2024-11-12 20:20:39,563 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-12 20:20:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 622 transitions. [2024-11-12 20:20:39,565 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 622 transitions. Word has length 151 [2024-11-12 20:20:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:39,569 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 622 transitions. [2024-11-12 20:20:39,569 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-12 20:20:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 622 transitions. [2024-11-12 20:20:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 20:20:39,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:39,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:39,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:20:39,576 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-12 20:20:39,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash -315882022, now seen corresponding path program 1 times [2024-11-12 20:20:39,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:39,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682581011] [2024-11-12 20:20:39,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:39,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:20:39,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682581011] [2024-11-12 20:20:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682581011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:39,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:39,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:20:39,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708683069] [2024-11-12 20:20:39,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:39,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:20:39,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:39,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:20:39,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:20:39,926 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-12 20:20:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:39,985 INFO L93 Difference]: Finished difference Result 869 states and 1246 transitions. [2024-11-12 20:20:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:20:39,985 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-12 20:20:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:39,988 INFO L225 Difference]: With dead ends: 869 [2024-11-12 20:20:39,988 INFO L226 Difference]: Without dead ends: 441 [2024-11-12 20:20:39,990 INFO L434 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-12 20:20:39,991 INFO L435 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-12 20:20:39,991 INFO L436 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-12 20:20:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-12 20:20:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-12 20:20:40,003 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-12 20:20:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-12 20:20:40,006 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 151 [2024-11-12 20:20:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:40,007 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-12 20:20:40,007 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-12 20:20:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-12 20:20:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 20:20:40,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:40,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:40,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:20:40,011 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-12 20:20:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -803929128, now seen corresponding path program 1 times [2024-11-12 20:20:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404317060] [2024-11-12 20:20:40,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:20:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404317060] [2024-11-12 20:20:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404317060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:40,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:40,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:20:40,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919668493] [2024-11-12 20:20:40,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:40,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:20:40,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:40,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:20:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:20:40,243 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-12 20:20:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:40,293 INFO L93 Difference]: Finished difference Result 1008 states and 1442 transitions. [2024-11-12 20:20:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:20:40,295 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-12 20:20:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:40,298 INFO L225 Difference]: With dead ends: 1008 [2024-11-12 20:20:40,298 INFO L226 Difference]: Without dead ends: 574 [2024-11-12 20:20:40,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:20:40,300 INFO L435 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-12 20:20:40,301 INFO L436 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-12 20:20:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-12 20:20:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-11-12 20:20:40,314 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-12 20:20:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 820 transitions. [2024-11-12 20:20:40,317 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 820 transitions. Word has length 151 [2024-11-12 20:20:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:40,318 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 820 transitions. [2024-11-12 20:20:40,318 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-12 20:20:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 820 transitions. [2024-11-12 20:20:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 20:20:40,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:40,321 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:40,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:20:40,321 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-12 20:20:40,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2044506263, now seen corresponding path program 1 times [2024-11-12 20:20:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966506829] [2024-11-12 20:20:40,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:20:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:20:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:20:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:40,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966506829] [2024-11-12 20:20:40,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966506829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:40,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:40,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:20:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074793142] [2024-11-12 20:20:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:40,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:20:40,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:20:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:20:40,741 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-12 20:20:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:41,215 INFO L93 Difference]: Finished difference Result 969 states and 1384 transitions. [2024-11-12 20:20:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:20:41,216 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-12 20:20:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:41,219 INFO L225 Difference]: With dead ends: 969 [2024-11-12 20:20:41,219 INFO L226 Difference]: Without dead ends: 535 [2024-11-12 20:20:41,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:20:41,221 INFO L435 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.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:41,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1893 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:20:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-12 20:20:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 532. [2024-11-12 20:20:41,267 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-12 20:20:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 743 transitions. [2024-11-12 20:20:41,270 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 743 transitions. Word has length 166 [2024-11-12 20:20:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:41,270 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 743 transitions. [2024-11-12 20:20:41,271 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-12 20:20:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 743 transitions. [2024-11-12 20:20:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 20:20:41,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:41,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:41,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:20:41,273 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-12 20:20:41,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash -467033507, now seen corresponding path program 1 times [2024-11-12 20:20:41,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:41,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995829079] [2024-11-12 20:20:41,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:20:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:41,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:20:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:20:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:41,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995829079] [2024-11-12 20:20:41,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995829079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:41,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:41,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:20:41,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156812818] [2024-11-12 20:20:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:41,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:20:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:20:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:20:41,593 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-12 20:20:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:42,062 INFO L93 Difference]: Finished difference Result 1073 states and 1497 transitions. [2024-11-12 20:20:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:42,063 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-12 20:20:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:42,066 INFO L225 Difference]: With dead ends: 1073 [2024-11-12 20:20:42,066 INFO L226 Difference]: Without dead ends: 681 [2024-11-12 20:20:42,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:20:42,068 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 249 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-12 20:20:42,069 INFO L436 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-12 20:20:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-12 20:20:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 678. [2024-11-12 20:20:42,084 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-12 20:20:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 940 transitions. [2024-11-12 20:20:42,087 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 940 transitions. Word has length 166 [2024-11-12 20:20:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:42,087 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 940 transitions. [2024-11-12 20:20:42,088 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-12 20:20:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 940 transitions. [2024-11-12 20:20:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 20:20:42,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:42,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:42,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:20:42,090 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-12 20:20:42,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1374700938, now seen corresponding path program 1 times [2024-11-12 20:20:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838253399] [2024-11-12 20:20:42,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:20:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:20:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 20:20:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 20:20:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:20:42,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838253399] [2024-11-12 20:20:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838253399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:20:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499935453] [2024-11-12 20:20:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:20:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:20:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:20:42,514 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-12 20:20:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:43,050 INFO L93 Difference]: Finished difference Result 747 states and 1041 transitions. [2024-11-12 20:20:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:20:43,051 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-12 20:20:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:43,056 INFO L225 Difference]: With dead ends: 747 [2024-11-12 20:20:43,056 INFO L226 Difference]: Without dead ends: 745 [2024-11-12 20:20:43,056 INFO L434 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-12 20:20:43,059 INFO L435 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.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:43,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1956 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:20:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-12 20:20:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 742. [2024-11-12 20:20:43,083 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-12 20:20:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1024 transitions. [2024-11-12 20:20:43,086 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1024 transitions. Word has length 181 [2024-11-12 20:20:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:43,088 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1024 transitions. [2024-11-12 20:20:43,088 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-12 20:20:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1024 transitions. [2024-11-12 20:20:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 20:20:43,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:43,093 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:43,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 20:20:43,093 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-12 20:20:43,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:43,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1170292628, now seen corresponding path program 1 times [2024-11-12 20:20:43,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338714282] [2024-11-12 20:20:43,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:43,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:20:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:20:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 20:20:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 20:20:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:43,533 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-12 20:20:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338714282] [2024-11-12 20:20:43,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338714282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894907464] [2024-11-12 20:20:43,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:43,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:43,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:20:43,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:20:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:44,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 20:20:44,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:44,320 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-12 20:20:44,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:20:44,586 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-12 20:20:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894907464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:20:44,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:20:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-12 20:20:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108490509] [2024-11-12 20:20:44,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:20:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:20:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:44,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:20:44,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:20:44,589 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-12 20:20:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:45,099 INFO L93 Difference]: Finished difference Result 1132 states and 1587 transitions. [2024-11-12 20:20:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:20:45,100 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-12 20:20:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:45,104 INFO L225 Difference]: With dead ends: 1132 [2024-11-12 20:20:45,105 INFO L226 Difference]: Without dead ends: 1098 [2024-11-12 20:20:45,105 INFO L434 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-12 20:20:45,106 INFO L435 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.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:45,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 3414 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:20:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-12 20:20:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1095. [2024-11-12 20:20:45,171 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-12 20:20:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1511 transitions. [2024-11-12 20:20:45,175 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1511 transitions. Word has length 186 [2024-11-12 20:20:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:45,176 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1511 transitions. [2024-11-12 20:20:45,176 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-12 20:20:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1511 transitions. [2024-11-12 20:20:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 20:20:45,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:45,179 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:45,200 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-12 20:20:45,383 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-12 20:20:45,384 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-12 20:20:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1876231077, now seen corresponding path program 1 times [2024-11-12 20:20:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360103389] [2024-11-12 20:20:45,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 20:20:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:20:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 20:20:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 20:20:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:20:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360103389] [2024-11-12 20:20:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360103389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251387357] [2024-11-12 20:20:46,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:46,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:20:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:20:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:47,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 20:20:47,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:47,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:20:47,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-12 20:20:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:20:47,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:20:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251387357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:47,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:20:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-12 20:20:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309776285] [2024-11-12 20:20:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:20:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:20:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-12 20:20:47,891 INFO L87 Difference]: Start difference. First operand 1095 states and 1511 transitions. Second operand has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:20:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:50,005 INFO L93 Difference]: Finished difference Result 2134 states and 2939 transitions. [2024-11-12 20:20:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:20:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2024-11-12 20:20:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:50,011 INFO L225 Difference]: With dead ends: 2134 [2024-11-12 20:20:50,011 INFO L226 Difference]: Without dead ends: 1132 [2024-11-12 20:20:50,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-12 20:20:50,016 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 722 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:50,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 3425 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 20:20:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-12 20:20:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1127. [2024-11-12 20:20:50,038 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-12 20:20:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1548 transitions. [2024-11-12 20:20:50,042 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1548 transitions. Word has length 187 [2024-11-12 20:20:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1548 transitions. [2024-11-12 20:20:50,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:20:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1548 transitions. [2024-11-12 20:20:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 20:20:50,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:50,045 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:50,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 20:20:50,245 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-12 20:20:50,246 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-12 20:20:50,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2110538288, now seen corresponding path program 1 times [2024-11-12 20:20:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:50,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320068171] [2024-11-12 20:20:50,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:20:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:20:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 20:20:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 20:20:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:20:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320068171] [2024-11-12 20:20:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320068171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749623936] [2024-11-12 20:20:51,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:51,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:51,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:51,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:20:51,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:20:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:51,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 20:20:51,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:20:51,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:20:51,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749623936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:51,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:20:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-12 20:20:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047175363] [2024-11-12 20:20:51,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:51,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:20:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:51,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:20:51,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:20:51,997 INFO L87 Difference]: Start difference. First operand 1127 states and 1548 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:20:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:52,206 INFO L93 Difference]: Finished difference Result 2220 states and 3049 transitions. [2024-11-12 20:20:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:52,207 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-12 20:20:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:52,212 INFO L225 Difference]: With dead ends: 2220 [2024-11-12 20:20:52,212 INFO L226 Difference]: Without dead ends: 1218 [2024-11-12 20:20:52,213 INFO L434 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-12 20:20:52,214 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 17 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:52,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1385 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:20:52,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-12 20:20:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1194. [2024-11-12 20:20:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1159 states have (on average 1.355478861087144) internal successors, (1571), 1173 states have internal predecessors, (1571), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 20:20:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1627 transitions. [2024-11-12 20:20:52,241 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1627 transitions. Word has length 188 [2024-11-12 20:20:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1627 transitions. [2024-11-12 20:20:52,242 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-12 20:20:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1627 transitions. [2024-11-12 20:20:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 20:20:52,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:52,244 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:52,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 20:20:52,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:52,449 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-12 20:20:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1224994656, now seen corresponding path program 1 times [2024-11-12 20:20:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882934468] [2024-11-12 20:20:52,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:20:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:20:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 20:20:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 20:20:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:20:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882934468] [2024-11-12 20:20:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882934468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:52,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:52,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 20:20:52,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181735769] [2024-11-12 20:20:52,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:52,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:20:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:52,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:20:52,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:20:52,975 INFO L87 Difference]: Start difference. First operand 1194 states and 1627 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-12 20:20:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:53,696 INFO L93 Difference]: Finished difference Result 2280 states and 3131 transitions. [2024-11-12 20:20:53,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:20:53,697 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-12 20:20:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:53,702 INFO L225 Difference]: With dead ends: 2280 [2024-11-12 20:20:53,702 INFO L226 Difference]: Without dead ends: 1215 [2024-11-12 20:20:53,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:20:53,705 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 14 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:53,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2080 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:20:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-12 20:20:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1206. [2024-11-12 20:20:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1171 states have (on average 1.354397950469684) internal successors, (1586), 1185 states have internal predecessors, (1586), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 20:20:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1642 transitions. [2024-11-12 20:20:53,741 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1642 transitions. Word has length 189 [2024-11-12 20:20:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:53,741 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1642 transitions. [2024-11-12 20:20:53,741 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-12 20:20:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1642 transitions. [2024-11-12 20:20:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 20:20:53,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:53,744 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:53,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 20:20:53,744 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-12 20:20:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash 550054889, now seen corresponding path program 1 times [2024-11-12 20:20:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789662063] [2024-11-12 20:20:53,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:20:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:20:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 20:20:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 20:20:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:20:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789662063] [2024-11-12 20:20:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789662063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:54,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:20:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 20:20:54,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538943443] [2024-11-12 20:20:54,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:54,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:20:54,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:20:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:20:54,208 INFO L87 Difference]: Start difference. First operand 1206 states and 1642 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-12 20:20:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:54,989 INFO L93 Difference]: Finished difference Result 2308 states and 3169 transitions. [2024-11-12 20:20:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:20:54,990 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-12 20:20:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:54,994 INFO L225 Difference]: With dead ends: 2308 [2024-11-12 20:20:54,994 INFO L226 Difference]: Without dead ends: 1242 [2024-11-12 20:20:54,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:20:54,996 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 18 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:54,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2787 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:20:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2024-11-12 20:20:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1230. [2024-11-12 20:20:55,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1195 states have (on average 1.3548117154811716) internal successors, (1619), 1209 states have internal predecessors, (1619), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 20:20:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1675 transitions. [2024-11-12 20:20:55,025 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1675 transitions. Word has length 190 [2024-11-12 20:20:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1675 transitions. [2024-11-12 20:20:55,025 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-12 20:20:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1675 transitions. [2024-11-12 20:20:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 20:20:55,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:55,028 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:55,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 20:20:55,028 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-12 20:20:55,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1910520627, now seen corresponding path program 1 times [2024-11-12 20:20:55,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:55,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001271059] [2024-11-12 20:20:55,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:20:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:55,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:20:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:55,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 20:20:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 20:20:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:20:55,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001271059] [2024-11-12 20:20:55,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001271059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:55,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324469588] [2024-11-12 20:20:55,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:55,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:55,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:55,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:20:55,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 20:20:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:56,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 20:20:56,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 20:20:56,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:20:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324469588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:20:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:20:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-12 20:20:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509112380] [2024-11-12 20:20:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:20:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:20:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:20:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:20:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:20:56,607 INFO L87 Difference]: Start difference. First operand 1230 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:20:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:20:56,660 INFO L93 Difference]: Finished difference Result 2275 states and 3114 transitions. [2024-11-12 20:20:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:20:56,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2024-11-12 20:20:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:20:56,667 INFO L225 Difference]: With dead ends: 2275 [2024-11-12 20:20:56,667 INFO L226 Difference]: Without dead ends: 1233 [2024-11-12 20:20:56,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:20:56,669 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 0 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:20:56,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1583 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:20:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2024-11-12 20:20:56,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2024-11-12 20:20:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1197 states have (on average 1.3550543024227235) internal successors, (1622), 1212 states have internal predecessors, (1622), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2024-11-12 20:20:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1684 transitions. [2024-11-12 20:20:56,712 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1684 transitions. Word has length 190 [2024-11-12 20:20:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:20:56,712 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 1684 transitions. [2024-11-12 20:20:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:20:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1684 transitions. [2024-11-12 20:20:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 20:20:56,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:20:56,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:20:56,741 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-12 20:20:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:56,915 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-12 20:20:56,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:20:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash -178802935, now seen corresponding path program 1 times [2024-11-12 20:20:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:20:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496839416] [2024-11-12 20:20:56,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:20:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:58,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:20:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:58,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:20:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 20:20:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 20:20:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:20:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:20:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496839416] [2024-11-12 20:20:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496839416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:20:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320903524] [2024-11-12 20:20:58,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:20:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:20:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:20:58,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:20:58,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 20:20:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:20:59,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 151 conjuncts are in the unsatisfiable core [2024-11-12 20:20:59,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:20:59,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 20:20:59,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:20:59,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-12 20:20:59,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-12 20:20:59,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 20:20:59,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:20:59,574 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-12 20:20:59,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-12 20:20:59,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 20:20:59,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-12 20:20:59,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:20:59,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:20:59,783 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 20:20:59,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-12 20:20:59,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 20:20:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 20:21:52,864 INFO L224 Elim1Store]: Index analysis took 1041 ms