./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 21:54:54,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 21:54:55,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 21:54:55,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 21:54:55,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 21:54:55,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 21:54:55,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 21:54:55,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 21:54:55,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 21:54:55,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 21:54:55,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 21:54:55,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 21:54:55,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 21:54:55,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 21:54:55,077 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 21:54:55,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 21:54:55,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 21:54:55,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 21:54:55,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 21:54:55,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 21:54:55,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 21:54:55,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 21:54:55,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 21:54:55,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 21:54:55,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 21:54:55,080 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 21:54:55,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 21:54:55,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 21:54:55,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 21:54:55,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 21:54:55,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 21:54:55,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 21:54:55,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 21:54:55,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 21:54:55,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:54:55,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 21:54:55,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 21:54:55,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 21:54:55,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 21:54:55,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 21:54:55,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 21:54:55,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 21:54:55,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 21:54:55,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 21:54:55,086 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2024-11-10 21:54:55,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 21:54:55,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 21:54:55,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 21:54:55,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 21:54:55,371 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 21:54:55,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-10 21:54:56,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 21:54:57,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 21:54:57,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-10 21:54:57,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc36ea4e4/ebae247cf43f462eb1059c7b61af1d8c/FLAGd70a455bc [2024-11-10 21:54:57,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc36ea4e4/ebae247cf43f462eb1059c7b61af1d8c [2024-11-10 21:54:57,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 21:54:57,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 21:54:57,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 21:54:57,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 21:54:57,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 21:54:57,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:54:57" (1/1) ... [2024-11-10 21:54:57,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24feba4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:57, skipping insertion in model container [2024-11-10 21:54:57,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:54:57" (1/1) ... [2024-11-10 21:54:57,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 21:54:57,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:54:57,965 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 21:54:58,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 21:54:58,134 INFO L204 MainTranslator]: Completed translation [2024-11-10 21:54:58,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58 WrapperNode [2024-11-10 21:54:58,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 21:54:58,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 21:54:58,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 21:54:58,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 21:54:58,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,264 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1563 [2024-11-10 21:54:58,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 21:54:58,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 21:54:58,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 21:54:58,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 21:54:58,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,379 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-10 21:54:58,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 21:54:58,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 21:54:58,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 21:54:58,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 21:54:58,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (1/1) ... [2024-11-10 21:54:58,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 21:54:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:54:58,518 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-10 21:54:58,521 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-10 21:54:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 21:54:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 21:54:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 21:54:58,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 21:54:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 21:54:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 21:54:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 21:54:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 21:54:58,570 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 21:54:58,571 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 21:54:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 21:54:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 21:54:58,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 21:54:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 21:54:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 21:54:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 21:54:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 21:54:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 21:54:58,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 21:54:58,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 21:54:58,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 21:54:58,913 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 21:54:58,916 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 21:55:00,429 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-10 21:55:00,430 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 21:55:00,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 21:55:00,501 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 21:55:00,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:00 BoogieIcfgContainer [2024-11-10 21:55:00,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 21:55:00,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 21:55:00,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 21:55:00,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 21:55:00,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:54:57" (1/3) ... [2024-11-10 21:55:00,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521ee2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:00, skipping insertion in model container [2024-11-10 21:55:00,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:54:58" (2/3) ... [2024-11-10 21:55:00,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521ee2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:55:00, skipping insertion in model container [2024-11-10 21:55:00,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:55:00" (3/3) ... [2024-11-10 21:55:00,515 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2024-11-10 21:55:00,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 21:55:00,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-10 21:55:00,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 21:55:00,621 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;@3f95bec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 21:55:00,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 21:55:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 445 states, 420 states have (on average 1.6095238095238096) internal successors, (676), 436 states have internal predecessors, (676), 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-10 21:55:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 21:55:00,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:00,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:00,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:00,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash 406330624, now seen corresponding path program 1 times [2024-11-10 21:55:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806618461] [2024-11-10 21:55:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 21:55:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806618461] [2024-11-10 21:55:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806618461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:00,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 21:55:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268404538] [2024-11-10 21:55:00,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:00,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 21:55:00,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 21:55:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 21:55:00,834 INFO L87 Difference]: Start difference. First operand has 445 states, 420 states have (on average 1.6095238095238096) internal successors, (676), 436 states have internal predecessors, (676), 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, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:01,046 INFO L93 Difference]: Finished difference Result 886 states and 1423 transitions. [2024-11-10 21:55:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 21:55:01,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 21:55:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:01,067 INFO L225 Difference]: With dead ends: 886 [2024-11-10 21:55:01,067 INFO L226 Difference]: Without dead ends: 438 [2024-11-10 21:55:01,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-10 21:55:01,077 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:01,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-10 21:55:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-10 21:55:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 415 states have (on average 1.4457831325301205) internal successors, (600), 429 states have internal predecessors, (600), 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-10 21:55:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 632 transitions. [2024-11-10 21:55:01,161 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 632 transitions. Word has length 7 [2024-11-10 21:55:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:01,162 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 632 transitions. [2024-11-10 21:55:01,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 21:55:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 632 transitions. [2024-11-10 21:55:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 21:55:01,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:01,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:01,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 21:55:01,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:01,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash -311616649, now seen corresponding path program 1 times [2024-11-10 21:55:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225247661] [2024-11-10 21:55:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:01,256 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-10 21:55:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225247661] [2024-11-10 21:55:01,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225247661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:01,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:01,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739705211] [2024-11-10 21:55:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:01,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:55:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:01,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:55:01,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:01,261 INFO L87 Difference]: Start difference. First operand 438 states and 632 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10 21:55:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:01,467 INFO L93 Difference]: Finished difference Result 865 states and 1253 transitions. [2024-11-10 21:55:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:55:01,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-10 21:55:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:01,474 INFO L225 Difference]: With dead ends: 865 [2024-11-10 21:55:01,475 INFO L226 Difference]: Without dead ends: 830 [2024-11-10 21:55:01,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:01,478 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 552 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:01,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1247 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 21:55:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-10 21:55:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 444. [2024-11-10 21:55:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 421 states have (on average 1.4394299287410925) internal successors, (606), 435 states have internal predecessors, (606), 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-10 21:55:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 638 transitions. [2024-11-10 21:55:01,521 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 638 transitions. Word has length 8 [2024-11-10 21:55:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:01,522 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 638 transitions. [2024-11-10 21:55:01,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-10 21:55:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 638 transitions. [2024-11-10 21:55:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:55:01,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:01,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:01,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 21:55:01,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:01,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -532612145, now seen corresponding path program 1 times [2024-11-10 21:55:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62165896] [2024-11-10 21:55:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:02,163 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-10 21:55:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62165896] [2024-11-10 21:55:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62165896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:02,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:02,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:02,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003531952] [2024-11-10 21:55:02,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:02,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:02,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:02,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:02,166 INFO L87 Difference]: Start difference. First operand 444 states and 638 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10 21:55:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:02,346 INFO L93 Difference]: Finished difference Result 845 states and 1212 transitions. [2024-11-10 21:55:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:55:02,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 155 [2024-11-10 21:55:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:02,349 INFO L225 Difference]: With dead ends: 845 [2024-11-10 21:55:02,349 INFO L226 Difference]: Without dead ends: 409 [2024-11-10 21:55:02,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:02,354 INFO L432 NwaCegarLoop]: 495 mSDtfsCounter, 23 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:02,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1463 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-10 21:55:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 408. [2024-11-10 21:55:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 385 states have (on average 1.3974025974025974) internal successors, (538), 399 states have internal predecessors, (538), 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-10 21:55:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 570 transitions. [2024-11-10 21:55:02,370 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 570 transitions. Word has length 155 [2024-11-10 21:55:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:02,370 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 570 transitions. [2024-11-10 21:55:02,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10 21:55:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 570 transitions. [2024-11-10 21:55:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:55:02,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:02,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:02,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 21:55:02,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash -317782992, now seen corresponding path program 1 times [2024-11-10 21:55:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:02,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127923877] [2024-11-10 21:55:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:02,766 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-10 21:55:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:02,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127923877] [2024-11-10 21:55:02,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127923877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:02,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:02,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:02,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68771334] [2024-11-10 21:55:02,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:02,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:02,771 INFO L87 Difference]: Start difference. First operand 408 states and 570 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10 21:55:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:02,927 INFO L93 Difference]: Finished difference Result 796 states and 1120 transitions. [2024-11-10 21:55:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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 155 [2024-11-10 21:55:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:02,931 INFO L225 Difference]: With dead ends: 796 [2024-11-10 21:55:02,931 INFO L226 Difference]: Without dead ends: 396 [2024-11-10 21:55:02,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:02,936 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 27 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:02,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1460 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-10 21:55:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-10 21:55:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 373 states have (on average 1.3914209115281502) internal successors, (519), 387 states have internal predecessors, (519), 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-10 21:55:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 551 transitions. [2024-11-10 21:55:02,953 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 551 transitions. Word has length 155 [2024-11-10 21:55:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:02,955 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 551 transitions. [2024-11-10 21:55:02,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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-10 21:55:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 551 transitions. [2024-11-10 21:55:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 21:55:02,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:02,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 21:55:02,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 556892297, now seen corresponding path program 1 times [2024-11-10 21:55:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764288471] [2024-11-10 21:55:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:03,162 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-10 21:55:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764288471] [2024-11-10 21:55:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764288471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:03,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:03,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 21:55:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097903142] [2024-11-10 21:55:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:03,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 21:55:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 21:55:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:03,166 INFO L87 Difference]: Start difference. First operand 396 states and 551 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-10 21:55:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:03,289 INFO L93 Difference]: Finished difference Result 865 states and 1203 transitions. [2024-11-10 21:55:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 21:55:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2024-11-10 21:55:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:03,292 INFO L225 Difference]: With dead ends: 865 [2024-11-10 21:55:03,292 INFO L226 Difference]: Without dead ends: 477 [2024-11-10 21:55:03,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 21:55:03,294 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 54 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:03,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1011 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-10 21:55:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-11-10 21:55:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 454 states have (on average 1.381057268722467) internal successors, (627), 468 states have internal predecessors, (627), 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-10 21:55:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 659 transitions. [2024-11-10 21:55:03,305 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 659 transitions. Word has length 155 [2024-11-10 21:55:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:03,306 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 659 transitions. [2024-11-10 21:55:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-10 21:55:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 659 transitions. [2024-11-10 21:55:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:55:03,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:03,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:03,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 21:55:03,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:03,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash -546913248, now seen corresponding path program 1 times [2024-11-10 21:55:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:03,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983119446] [2024-11-10 21:55:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:03,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:03,674 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-10 21:55:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983119446] [2024-11-10 21:55:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983119446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:03,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:55:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555630299] [2024-11-10 21:55:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:03,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:55:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:55:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:03,677 INFO L87 Difference]: Start difference. First operand 477 states and 659 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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-10 21:55:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:04,167 INFO L93 Difference]: Finished difference Result 826 states and 1145 transitions. [2024-11-10 21:55:04,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:55:04,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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 170 [2024-11-10 21:55:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:04,171 INFO L225 Difference]: With dead ends: 826 [2024-11-10 21:55:04,174 INFO L226 Difference]: Without dead ends: 438 [2024-11-10 21:55:04,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:55:04,176 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 42 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:04,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1494 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 21:55:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-10 21:55:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2024-11-10 21:55:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 412 states have (on average 1.3349514563106797) internal successors, (550), 426 states have internal predecessors, (550), 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-10 21:55:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 582 transitions. [2024-11-10 21:55:04,196 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 582 transitions. Word has length 170 [2024-11-10 21:55:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:04,197 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 582 transitions. [2024-11-10 21:55:04,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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-10 21:55:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 582 transitions. [2024-11-10 21:55:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:55:04,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:04,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:04,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 21:55:04,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:04,201 INFO L85 PathProgramCache]: Analyzing trace with hash -434646058, now seen corresponding path program 1 times [2024-11-10 21:55:04,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504411365] [2024-11-10 21:55:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:04,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:04,508 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-10 21:55:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:04,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504411365] [2024-11-10 21:55:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504411365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 21:55:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215877816] [2024-11-10 21:55:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:04,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:55:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:55:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:04,511 INFO L87 Difference]: Start difference. First operand 435 states and 582 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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-10 21:55:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:04,960 INFO L93 Difference]: Finished difference Result 778 states and 1051 transitions. [2024-11-10 21:55:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 21:55:04,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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 170 [2024-11-10 21:55:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:04,964 INFO L225 Difference]: With dead ends: 778 [2024-11-10 21:55:04,964 INFO L226 Difference]: Without dead ends: 432 [2024-11-10 21:55:04,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-10 21:55:04,966 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 15 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:04,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1501 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:55:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-10 21:55:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 429. [2024-11-10 21:55:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 406 states have (on average 1.3300492610837438) internal successors, (540), 420 states have internal predecessors, (540), 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-10 21:55:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 572 transitions. [2024-11-10 21:55:04,987 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 572 transitions. Word has length 170 [2024-11-10 21:55:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:04,988 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 572 transitions. [2024-11-10 21:55:04,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 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-10 21:55:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 572 transitions. [2024-11-10 21:55:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 21:55:04,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:04,990 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 21:55:04,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1924100826, now seen corresponding path program 1 times [2024-11-10 21:55:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829440732] [2024-11-10 21:55:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:05,279 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-10 21:55:05,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:05,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829440732] [2024-11-10 21:55:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829440732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:05,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622732097] [2024-11-10 21:55:05,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:05,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:05,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:05,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:05,282 INFO L87 Difference]: Start difference. First operand 429 states and 572 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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-10 21:55:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:05,739 INFO L93 Difference]: Finished difference Result 914 states and 1230 transitions. [2024-11-10 21:55:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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 170 [2024-11-10 21:55:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:05,743 INFO L225 Difference]: With dead ends: 914 [2024-11-10 21:55:05,743 INFO L226 Difference]: Without dead ends: 574 [2024-11-10 21:55:05,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 21:55:05,744 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 166 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:05,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1153 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:55:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-10 21:55:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 571. [2024-11-10 21:55:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 545 states have (on average 1.3266055045871559) internal successors, (723), 559 states have internal predecessors, (723), 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-10 21:55:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 761 transitions. [2024-11-10 21:55:05,770 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 761 transitions. Word has length 170 [2024-11-10 21:55:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:05,771 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 761 transitions. [2024-11-10 21:55:05,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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-10 21:55:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 761 transitions. [2024-11-10 21:55:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 21:55:05,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:05,773 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 21:55:05,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -993147155, now seen corresponding path program 1 times [2024-11-10 21:55:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784873099] [2024-11-10 21:55:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:55:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:55:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:06,164 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-10 21:55:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784873099] [2024-11-10 21:55:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784873099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:06,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:06,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 21:55:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267122807] [2024-11-10 21:55:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 21:55:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 21:55:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:06,166 INFO L87 Difference]: Start difference. First operand 571 states and 761 transitions. Second operand has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-10 21:55:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:06,637 INFO L93 Difference]: Finished difference Result 642 states and 864 transitions. [2024-11-10 21:55:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 21:55:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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 185 [2024-11-10 21:55:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:06,641 INFO L225 Difference]: With dead ends: 642 [2024-11-10 21:55:06,641 INFO L226 Difference]: Without dead ends: 640 [2024-11-10 21:55:06,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 21:55:06,642 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 220 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:06,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1541 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:55:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-10 21:55:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2024-11-10 21:55:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 607 states have (on average 1.3212520593080725) internal successors, (802), 621 states have internal predecessors, (802), 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-10 21:55:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 846 transitions. [2024-11-10 21:55:06,663 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 846 transitions. Word has length 185 [2024-11-10 21:55:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:06,664 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 846 transitions. [2024-11-10 21:55:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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-10 21:55:06,665 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 846 transitions. [2024-11-10 21:55:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 21:55:06,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:06,667 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 21:55:06,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 21:55:06,667 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-10 21:55:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash -756985630, now seen corresponding path program 1 times [2024-11-10 21:55:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274579235] [2024-11-10 21:55:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:55:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:55:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:07,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:07,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274579235] [2024-11-10 21:55:07,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274579235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:07,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401678889] [2024-11-10 21:55:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:07,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:07,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:07,099 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-10 21:55:07,101 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-10 21:55:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:07,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 21:55:07,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:07,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 21:55:08,201 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401678889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 21:55:08,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 21:55:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-10 21:55:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375544087] [2024-11-10 21:55:08,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 21:55:08,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 21:55:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:08,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 21:55:08,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:55:08,207 INFO L87 Difference]: Start difference. First operand 636 states and 846 transitions. Second operand has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 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-10 21:55:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:08,939 INFO L93 Difference]: Finished difference Result 976 states and 1323 transitions. [2024-11-10 21:55:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:55:08,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 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 193 [2024-11-10 21:55:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:08,947 INFO L225 Difference]: With dead ends: 976 [2024-11-10 21:55:08,948 INFO L226 Difference]: Without dead ends: 941 [2024-11-10 21:55:08,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 388 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-10 21:55:08,949 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1192 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:08,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 2334 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:55:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-10 21:55:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2024-11-10 21:55:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 903 states have (on average 1.317829457364341) internal successors, (1190), 917 states have internal predecessors, (1190), 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-10 21:55:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1246 transitions. [2024-11-10 21:55:08,973 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1246 transitions. Word has length 193 [2024-11-10 21:55:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:08,973 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1246 transitions. [2024-11-10 21:55:08,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 46.45454545454545) internal successors, (511), 10 states have internal predecessors, (511), 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-10 21:55:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1246 transitions. [2024-11-10 21:55:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-10 21:55:08,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:08,976 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:08,998 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-10 21:55:09,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 21:55:09,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:09,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash -734020793, now seen corresponding path program 1 times [2024-11-10 21:55:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:09,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403180729] [2024-11-10 21:55:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-10 21:55:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 21:55:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:10,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 21:55:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:55:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:55:10,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403180729] [2024-11-10 21:55:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403180729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478013975] [2024-11-10 21:55:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:10,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:10,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:10,189 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-10 21:55:10,190 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-10 21:55:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:10,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 21:55:10,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:10,810 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-10 21:55:10,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 21:55:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:11,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:11,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478013975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-10 21:55:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265619960] [2024-11-10 21:55:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 21:55:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:11,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 21:55:11,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-10 21:55:11,697 INFO L87 Difference]: Start difference. First operand 938 states and 1246 transitions. Second operand has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 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-10 21:55:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:14,373 INFO L93 Difference]: Finished difference Result 1834 states and 2447 transitions. [2024-11-10 21:55:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 21:55:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 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 193 [2024-11-10 21:55:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:14,379 INFO L225 Difference]: With dead ends: 1834 [2024-11-10 21:55:14,379 INFO L226 Difference]: Without dead ends: 938 [2024-11-10 21:55:14,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-11-10 21:55:14,381 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 468 mSDsluCounter, 3182 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 3634 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:14,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 3634 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 21:55:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-10 21:55:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2024-11-10 21:55:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 903 states have (on average 1.3167220376522701) internal successors, (1189), 917 states have internal predecessors, (1189), 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-10 21:55:14,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1245 transitions. [2024-11-10 21:55:14,405 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1245 transitions. Word has length 193 [2024-11-10 21:55:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:14,406 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1245 transitions. [2024-11-10 21:55:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.666666666666666) internal successors, (176), 12 states have internal predecessors, (176), 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-10 21:55:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1245 transitions. [2024-11-10 21:55:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 21:55:14,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:14,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:14,429 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-10 21:55:14,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 21:55:14,613 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1857412612, now seen corresponding path program 1 times [2024-11-10 21:55:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851428652] [2024-11-10 21:55:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:15,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-10 21:55:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:15,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 21:55:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 21:55:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 21:55:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:55:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851428652] [2024-11-10 21:55:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851428652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287459625] [2024-11-10 21:55:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:15,705 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-10 21:55:15,706 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-10 21:55:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:16,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 21:55:16,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:16,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287459625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-10 21:55:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319910385] [2024-11-10 21:55:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:16,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:16,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:16,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:55:16,361 INFO L87 Difference]: Start difference. First operand 938 states and 1245 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-10 21:55:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:16,526 INFO L93 Difference]: Finished difference Result 1834 states and 2446 transitions. [2024-11-10 21:55:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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 194 [2024-11-10 21:55:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:16,532 INFO L225 Difference]: With dead ends: 1834 [2024-11-10 21:55:16,533 INFO L226 Difference]: Without dead ends: 938 [2024-11-10 21:55:16,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 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-10 21:55:16,535 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 13 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:16,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1156 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-11-10 21:55:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2024-11-10 21:55:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 903 states have (on average 1.3133997785160576) internal successors, (1186), 917 states have internal predecessors, (1186), 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-10 21:55:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1242 transitions. [2024-11-10 21:55:16,562 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1242 transitions. Word has length 194 [2024-11-10 21:55:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1242 transitions. [2024-11-10 21:55:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 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-10 21:55:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1242 transitions. [2024-11-10 21:55:16,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 21:55:16,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:16,566 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:16,587 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-10 21:55:16,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:16,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 106456042, now seen corresponding path program 1 times [2024-11-10 21:55:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239921166] [2024-11-10 21:55:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 21:55:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 21:55:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-10 21:55:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 21:55:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239921166] [2024-11-10 21:55:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239921166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:55:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631469932] [2024-11-10 21:55:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:55:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:55:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:55:17,299 INFO L87 Difference]: Start difference. First operand 938 states and 1242 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 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-10 21:55:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:17,938 INFO L93 Difference]: Finished difference Result 1843 states and 2472 transitions. [2024-11-10 21:55:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:55:17,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 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 195 [2024-11-10 21:55:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:17,943 INFO L225 Difference]: With dead ends: 1843 [2024-11-10 21:55:17,943 INFO L226 Difference]: Without dead ends: 950 [2024-11-10 21:55:17,944 INFO L431 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-10 21:55:17,944 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 10 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:17,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1773 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 21:55:17,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-11-10 21:55:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 947. [2024-11-10 21:55:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 912 states have (on average 1.3103070175438596) internal successors, (1195), 926 states have internal predecessors, (1195), 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-10 21:55:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1251 transitions. [2024-11-10 21:55:17,970 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1251 transitions. Word has length 195 [2024-11-10 21:55:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1251 transitions. [2024-11-10 21:55:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 6 states have internal predecessors, (178), 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-10 21:55:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1251 transitions. [2024-11-10 21:55:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 21:55:17,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:17,972 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:17,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 21:55:17,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash -977614906, now seen corresponding path program 1 times [2024-11-10 21:55:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091682459] [2024-11-10 21:55:17,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:55:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:55:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:18,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 21:55:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:18,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 21:55:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:55:18,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091682459] [2024-11-10 21:55:18,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091682459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126272595] [2024-11-10 21:55:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:18,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:18,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:18,668 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-10 21:55:18,669 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-10 21:55:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:19,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 21:55:19,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 21:55:19,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126272595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:19,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:19,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-10 21:55:19,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617430254] [2024-11-10 21:55:19,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:19,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:55:19,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:55:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:19,781 INFO L87 Difference]: Start difference. First operand 947 states and 1251 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:20,133 INFO L93 Difference]: Finished difference Result 1722 states and 2291 transitions. [2024-11-10 21:55:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:55:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2024-11-10 21:55:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:20,138 INFO L225 Difference]: With dead ends: 1722 [2024-11-10 21:55:20,138 INFO L226 Difference]: Without dead ends: 962 [2024-11-10 21:55:20,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:20,141 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 8 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:20,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1890 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 21:55:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-10 21:55:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 959. [2024-11-10 21:55:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 924 states have (on average 1.3062770562770563) internal successors, (1207), 938 states have internal predecessors, (1207), 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-10 21:55:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1263 transitions. [2024-11-10 21:55:20,166 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1263 transitions. Word has length 196 [2024-11-10 21:55:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1263 transitions. [2024-11-10 21:55:20,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1263 transitions. [2024-11-10 21:55:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-10 21:55:20,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:20,169 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:20,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 21:55:20,373 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-10 21:55:20,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:20,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash -815157072, now seen corresponding path program 1 times [2024-11-10 21:55:20,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197617783] [2024-11-10 21:55:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:20,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:55:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:55:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:20,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 21:55:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 21:55:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197617783] [2024-11-10 21:55:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197617783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:20,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:20,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 21:55:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898075765] [2024-11-10 21:55:20,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:20,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:55:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:20,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:55:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:55:20,882 INFO L87 Difference]: Start difference. First operand 959 states and 1263 transitions. Second operand has 8 states, 8 states have (on average 22.5) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:21,811 INFO L93 Difference]: Finished difference Result 1735 states and 2316 transitions. [2024-11-10 21:55:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:55:21,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2024-11-10 21:55:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:21,816 INFO L225 Difference]: With dead ends: 1735 [2024-11-10 21:55:21,817 INFO L226 Difference]: Without dead ends: 977 [2024-11-10 21:55:21,820 INFO L431 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-10 21:55:21,821 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 16 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:21,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2418 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 21:55:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-10 21:55:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-10 21:55:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 936 states have (on average 1.3055555555555556) internal successors, (1222), 950 states have internal predecessors, (1222), 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-10 21:55:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1278 transitions. [2024-11-10 21:55:21,844 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1278 transitions. Word has length 197 [2024-11-10 21:55:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:21,845 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1278 transitions. [2024-11-10 21:55:21,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.5) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1278 transitions. [2024-11-10 21:55:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 21:55:21,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:21,847 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:21,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 21:55:21,848 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash 712892227, now seen corresponding path program 1 times [2024-11-10 21:55:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572059376] [2024-11-10 21:55:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:55:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:55:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:22,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 21:55:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 21:55:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572059376] [2024-11-10 21:55:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572059376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:22,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 21:55:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781516794] [2024-11-10 21:55:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:22,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:55:22,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:22,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:55:22,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 21:55:22,308 INFO L87 Difference]: Start difference. First operand 971 states and 1278 transitions. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:23,076 INFO L93 Difference]: Finished difference Result 1756 states and 2343 transitions. [2024-11-10 21:55:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:55:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 198 [2024-11-10 21:55:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:23,081 INFO L225 Difference]: With dead ends: 1756 [2024-11-10 21:55:23,082 INFO L226 Difference]: Without dead ends: 983 [2024-11-10 21:55:23,083 INFO L431 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-10 21:55:23,084 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 10 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:23,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2097 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:55:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-10 21:55:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 980. [2024-11-10 21:55:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 945 states have (on average 1.3026455026455026) internal successors, (1231), 959 states have internal predecessors, (1231), 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-10 21:55:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1287 transitions. [2024-11-10 21:55:23,110 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1287 transitions. Word has length 198 [2024-11-10 21:55:23,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:23,110 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1287 transitions. [2024-11-10 21:55:23,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 6 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:23,111 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1287 transitions. [2024-11-10 21:55:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-10 21:55:23,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:23,113 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:23,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 21:55:23,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1435500127, now seen corresponding path program 1 times [2024-11-10 21:55:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:23,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988440497] [2024-11-10 21:55:23,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:55:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:55:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:23,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 21:55:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 21:55:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988440497] [2024-11-10 21:55:23,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988440497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:23,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:23,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 21:55:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499809357] [2024-11-10 21:55:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:23,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 21:55:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 21:55:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:23,845 INFO L87 Difference]: Start difference. First operand 980 states and 1287 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:24,786 INFO L93 Difference]: Finished difference Result 1793 states and 2389 transitions. [2024-11-10 21:55:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 21:55:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 198 [2024-11-10 21:55:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:24,791 INFO L225 Difference]: With dead ends: 1793 [2024-11-10 21:55:24,791 INFO L226 Difference]: Without dead ends: 1016 [2024-11-10 21:55:24,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-10 21:55:24,793 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 35 mSDsluCounter, 2773 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:24,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3190 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 21:55:24,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-10 21:55:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1004. [2024-11-10 21:55:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 969 states have (on average 1.301341589267286) internal successors, (1261), 983 states have internal predecessors, (1261), 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-10 21:55:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1317 transitions. [2024-11-10 21:55:24,817 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1317 transitions. Word has length 198 [2024-11-10 21:55:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:24,818 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1317 transitions. [2024-11-10 21:55:24,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 9 states have internal predecessors, (181), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1317 transitions. [2024-11-10 21:55:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 21:55:24,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:24,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:24,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 21:55:24,821 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:24,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1320579383, now seen corresponding path program 1 times [2024-11-10 21:55:24,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:24,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479486385] [2024-11-10 21:55:24,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:55:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:55:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 21:55:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 21:55:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:55:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479486385] [2024-11-10 21:55:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479486385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473387452] [2024-11-10 21:55:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:25,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:25,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:25,741 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-10 21:55:25,742 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-10 21:55:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:26,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 21:55:26,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:26,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473387452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-10 21:55:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775093158] [2024-11-10 21:55:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:26,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 21:55:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 21:55:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:26,692 INFO L87 Difference]: Start difference. First operand 1004 states and 1317 transitions. Second operand has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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-10 21:55:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:27,094 INFO L93 Difference]: Finished difference Result 1968 states and 2596 transitions. [2024-11-10 21:55:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 21:55:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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 199 [2024-11-10 21:55:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:27,099 INFO L225 Difference]: With dead ends: 1968 [2024-11-10 21:55:27,100 INFO L226 Difference]: Without dead ends: 1019 [2024-11-10 21:55:27,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:27,103 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 8 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:27,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2194 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 21:55:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-11-10 21:55:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1016. [2024-11-10 21:55:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 981 states have (on average 1.3007135575942916) internal successors, (1276), 995 states have internal predecessors, (1276), 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-10 21:55:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1332 transitions. [2024-11-10 21:55:27,131 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1332 transitions. Word has length 199 [2024-11-10 21:55:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1332 transitions. [2024-11-10 21:55:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.0) internal successors, (182), 7 states have internal predecessors, (182), 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-10 21:55:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1332 transitions. [2024-11-10 21:55:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 21:55:27,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:27,135 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:27,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 21:55:27,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 21:55:27,338 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2032483267, now seen corresponding path program 1 times [2024-11-10 21:55:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936437277] [2024-11-10 21:55:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 21:55:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:27,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 21:55:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 21:55:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 21:55:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:27,823 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936437277] [2024-11-10 21:55:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936437277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:27,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 21:55:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527850541] [2024-11-10 21:55:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:27,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:55:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:55:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 21:55:27,827 INFO L87 Difference]: Start difference. First operand 1016 states and 1332 transitions. Second operand has 8 states, 8 states have (on average 22.75) internal successors, (182), 7 states have internal predecessors, (182), 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-10 21:55:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:28,547 INFO L93 Difference]: Finished difference Result 1991 states and 2642 transitions. [2024-11-10 21:55:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:55:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 7 states have internal predecessors, (182), 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 199 [2024-11-10 21:55:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:28,552 INFO L225 Difference]: With dead ends: 1991 [2024-11-10 21:55:28,552 INFO L226 Difference]: Without dead ends: 1034 [2024-11-10 21:55:28,553 INFO L431 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-10 21:55:28,554 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 14 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:28,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2429 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:55:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-10 21:55:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1016. [2024-11-10 21:55:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 981 states have (on average 1.3007135575942916) internal successors, (1276), 995 states have internal predecessors, (1276), 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-10 21:55:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1332 transitions. [2024-11-10 21:55:28,575 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1332 transitions. Word has length 199 [2024-11-10 21:55:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:28,575 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1332 transitions. [2024-11-10 21:55:28,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.75) internal successors, (182), 7 states have internal predecessors, (182), 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-10 21:55:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1332 transitions. [2024-11-10 21:55:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 21:55:28,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:28,578 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:28,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 21:55:28,579 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -460571086, now seen corresponding path program 1 times [2024-11-10 21:55:28,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:28,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348535521] [2024-11-10 21:55:28,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:28,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:29,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 21:55:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:29,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 21:55:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:55:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 21:55:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:55:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:29,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348535521] [2024-11-10 21:55:29,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348535521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:29,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045830738] [2024-11-10 21:55:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:29,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:29,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:29,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 21:55:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:29,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 21:55:29,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:30,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045830738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:30,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:30,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2024-11-10 21:55:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388841559] [2024-11-10 21:55:30,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:30,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 21:55:30,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:30,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 21:55:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:55:30,086 INFO L87 Difference]: Start difference. First operand 1016 states and 1332 transitions. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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-10 21:55:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:31,381 INFO L93 Difference]: Finished difference Result 1998 states and 2631 transitions. [2024-11-10 21:55:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 21:55:31,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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 200 [2024-11-10 21:55:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:31,386 INFO L225 Difference]: With dead ends: 1998 [2024-11-10 21:55:31,386 INFO L226 Difference]: Without dead ends: 1046 [2024-11-10 21:55:31,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 21:55:31,388 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 13 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:31,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2563 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 21:55:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-10 21:55:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1031. [2024-11-10 21:55:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 996 states have (on average 1.2991967871485943) internal successors, (1294), 1010 states have internal predecessors, (1294), 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-10 21:55:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1350 transitions. [2024-11-10 21:55:31,412 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1350 transitions. Word has length 200 [2024-11-10 21:55:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:31,412 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1350 transitions. [2024-11-10 21:55:31,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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-10 21:55:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1350 transitions. [2024-11-10 21:55:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 21:55:31,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:31,414 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:31,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 21:55:31,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:31,615 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:31,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1326298132, now seen corresponding path program 1 times [2024-11-10 21:55:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029077156] [2024-11-10 21:55:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 21:55:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 21:55:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:32,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 21:55:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 21:55:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-10 21:55:32,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:32,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029077156] [2024-11-10 21:55:32,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029077156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:32,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 21:55:32,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 21:55:32,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628610829] [2024-11-10 21:55:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:32,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 21:55:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 21:55:32,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:32,140 INFO L87 Difference]: Start difference. First operand 1031 states and 1350 transitions. Second operand has 10 states, 10 states have (on average 18.3) internal successors, (183), 9 states have internal predecessors, (183), 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-10 21:55:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:32,824 INFO L93 Difference]: Finished difference Result 2026 states and 2682 transitions. [2024-11-10 21:55:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 21:55:32,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 9 states have internal predecessors, (183), 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 200 [2024-11-10 21:55:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:32,829 INFO L225 Difference]: With dead ends: 2026 [2024-11-10 21:55:32,829 INFO L226 Difference]: Without dead ends: 1064 [2024-11-10 21:55:32,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 21:55:32,832 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 22 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:32,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2533 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 21:55:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-10 21:55:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1052. [2024-11-10 21:55:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1017 states have (on average 1.2989183874139627) internal successors, (1321), 1031 states have internal predecessors, (1321), 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-10 21:55:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1377 transitions. [2024-11-10 21:55:32,855 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1377 transitions. Word has length 200 [2024-11-10 21:55:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1377 transitions. [2024-11-10 21:55:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.3) internal successors, (183), 9 states have internal predecessors, (183), 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-10 21:55:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1377 transitions. [2024-11-10 21:55:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 21:55:32,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:32,858 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 21:55:32,858 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:32,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 22587120, now seen corresponding path program 1 times [2024-11-10 21:55:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291761849] [2024-11-10 21:55:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 21:55:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-10 21:55:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:33,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-10 21:55:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:33,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 21:55:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 21:55:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291761849] [2024-11-10 21:55:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291761849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015931656] [2024-11-10 21:55:33,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:33,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:33,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 21:55:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:35,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 21:55:35,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 21:55:35,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 21:55:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015931656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 21:55:35,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 21:55:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-10 21:55:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909387672] [2024-11-10 21:55:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 21:55:35,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 21:55:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 21:55:35,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 21:55:35,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 21:55:35,566 INFO L87 Difference]: Start difference. First operand 1052 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 21:55:35,660 INFO L93 Difference]: Finished difference Result 1996 states and 2634 transitions. [2024-11-10 21:55:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 21:55:35,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 201 [2024-11-10 21:55:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 21:55:35,671 INFO L225 Difference]: With dead ends: 1996 [2024-11-10 21:55:35,671 INFO L226 Difference]: Without dead ends: 1055 [2024-11-10 21:55:35,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 207 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-10 21:55:35,675 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 21:55:35,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1271 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 21:55:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-11-10 21:55:35,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2024-11-10 21:55:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1019 states have (on average 1.2993130520117762) internal successors, (1324), 1034 states have internal predecessors, (1324), 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-10 21:55:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1386 transitions. [2024-11-10 21:55:35,713 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1386 transitions. Word has length 201 [2024-11-10 21:55:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 21:55:35,713 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1386 transitions. [2024-11-10 21:55:35,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 4 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 21:55:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1386 transitions. [2024-11-10 21:55:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 21:55:35,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 21:55:35,716 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 21:55:35,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 21:55:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:35,917 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-10 21:55:35,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 21:55:35,918 INFO L85 PathProgramCache]: Analyzing trace with hash -535706184, now seen corresponding path program 1 times [2024-11-10 21:55:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 21:55:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025231397] [2024-11-10 21:55:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 21:55:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 21:55:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 21:55:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 21:55:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 21:55:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-10 21:55:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 21:55:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025231397] [2024-11-10 21:55:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025231397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 21:55:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018259954] [2024-11-10 21:55:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 21:55:36,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 21:55:36,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 21:55:36,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 21:55:36,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 21:55:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 21:55:38,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-11-10 21:55:38,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 21:55:38,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 21:55:38,290 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2024-11-10 21:55:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 20 [2024-11-10 21:55:38,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 21:55:38,304 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 15 treesize of output 1 [2024-11-10 21:55:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-10 21:55:38,440 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 21:55:38,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-10 21:55:38,447 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 16 treesize of output 1