./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:19:53,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:19:53,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:19:53,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:19:53,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:19:53,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:19:53,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:19:53,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:19:53,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:19:53,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:19:53,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:19:53,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:19:53,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:19:53,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:19:53,576 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:19:53,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:19:53,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:19:53,577 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:19:53,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:19:53,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:19:53,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:19:53,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:19:53,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:19:53,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:19:53,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:19:53,580 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:19:53,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:19:53,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:19:53,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:19:53,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:19:53,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:19:53,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:19:53,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:19:53,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:19:53,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:19:53,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:19:53,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:19:53,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:19:53,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:19:53,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:19:53,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:19:53,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:19:53,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:19:53,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:19:53,585 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-clean/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-clean/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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2024-10-11 21:19:53,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:19:53,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:19:53,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:19:53,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:19:53,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:19:53,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2024-10-11 21:19:55,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:19:55,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:19:55,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2024-10-11 21:19:55,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/53dd626db/ac7fd63ebf9a4a5d97779e10792263c1/FLAGb86fe28f2 [2024-10-11 21:19:55,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/53dd626db/ac7fd63ebf9a4a5d97779e10792263c1 [2024-10-11 21:19:55,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:19:55,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:19:55,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:19:55,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:19:55,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:19:55,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9585a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55, skipping insertion in model container [2024-10-11 21:19:55,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:19:55,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:19:55,710 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:19:55,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:19:55,759 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:19:55,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55 WrapperNode [2024-10-11 21:19:55,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:19:55,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:19:55,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:19:55,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:19:55,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,797 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 286 [2024-10-11 21:19:55,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:19:55,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:19:55,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:19:55,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:19:55,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:19:55,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:19:55,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:19:55,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:19:55,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:19:55,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (1/1) ... [2024-10-11 21:19:55,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:19:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:19:55,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:19:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:19:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:19:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 21:19:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 21:19:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 21:19:55,930 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 21:19:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 21:19:55,930 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 21:19:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 21:19:55,930 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 21:19:55,932 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 21:19:55,932 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 21:19:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:19:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 21:19:55,933 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 21:19:55,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:19:55,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:19:56,016 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:19:56,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:19:56,430 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-11 21:19:56,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:19:56,493 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:19:56,493 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 21:19:56,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:19:56 BoogieIcfgContainer [2024-10-11 21:19:56,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:19:56,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:19:56,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:19:56,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:19:56,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:19:55" (1/3) ... [2024-10-11 21:19:56,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:19:56, skipping insertion in model container [2024-10-11 21:19:56,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:55" (2/3) ... [2024-10-11 21:19:56,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350e27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:19:56, skipping insertion in model container [2024-10-11 21:19:56,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:19:56" (3/3) ... [2024-10-11 21:19:56,504 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2024-10-11 21:19:56,532 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:19:56,533 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 21:19:56,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:19:56,603 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;@43b63cf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:19:56,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 21:19:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 106 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 21:19:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:19:56,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:56,621 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] [2024-10-11 21:19:56,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:19:56,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash 913972694, now seen corresponding path program 1 times [2024-10-11 21:19:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:56,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460165369] [2024-10-11 21:19:56,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:56,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:19:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:19:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:19:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:19:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460165369] [2024-10-11 21:19:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460165369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:19:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302377637] [2024-10-11 21:19:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:57,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:19:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:57,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:19:57,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:19:57,039 INFO L87 Difference]: Start difference. First operand has 128 states, 99 states have (on average 1.6666666666666667) internal successors, (165), 106 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:57,620 INFO L93 Difference]: Finished difference Result 282 states and 441 transitions. [2024-10-11 21:19:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:19:57,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:19:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:57,634 INFO L225 Difference]: With dead ends: 282 [2024-10-11 21:19:57,634 INFO L226 Difference]: Without dead ends: 156 [2024-10-11 21:19:57,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:19:57,643 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 279 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:57,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 249 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:19:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-11 21:19:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-10-11 21:19:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.5408163265306123) internal successors, (151), 104 states have internal predecessors, (151), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 21:19:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-10-11 21:19:57,704 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 59 [2024-10-11 21:19:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:57,704 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-10-11 21:19:57,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-10-11 21:19:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:19:57,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:57,707 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] [2024-10-11 21:19:57,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:19:57,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:19:57,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash 37953688, now seen corresponding path program 1 times [2024-10-11 21:19:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:57,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625864589] [2024-10-11 21:19:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:19:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:19:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:19:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:19:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625864589] [2024-10-11 21:19:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625864589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:57,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:57,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:19:57,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877309237] [2024-10-11 21:19:57,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:19:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:19:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:19:57,947 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:58,742 INFO L93 Difference]: Finished difference Result 421 states and 629 transitions. [2024-10-11 21:19:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:19:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:19:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:58,746 INFO L225 Difference]: With dead ends: 421 [2024-10-11 21:19:58,746 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 21:19:58,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:19:58,748 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 397 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:58,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 409 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:19:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 21:19:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 240. [2024-10-11 21:19:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 194 states have (on average 1.5463917525773196) internal successors, (300), 201 states have internal predecessors, (300), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-10-11 21:19:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 357 transitions. [2024-10-11 21:19:58,804 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 357 transitions. Word has length 59 [2024-10-11 21:19:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:58,806 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 357 transitions. [2024-10-11 21:19:58,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2024-10-11 21:19:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:19:58,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:58,808 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] [2024-10-11 21:19:58,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:19:58,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:19:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 241289688, now seen corresponding path program 1 times [2024-10-11 21:19:58,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:58,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962743966] [2024-10-11 21:19:58,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:58,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:19:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:19:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:19:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:19:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962743966] [2024-10-11 21:19:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962743966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:59,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:59,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:19:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247345321] [2024-10-11 21:19:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:59,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:19:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:59,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:19:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:19:59,012 INFO L87 Difference]: Start difference. First operand 240 states and 357 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:59,970 INFO L93 Difference]: Finished difference Result 678 states and 1017 transitions. [2024-10-11 21:19:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:19:59,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:19:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:59,974 INFO L225 Difference]: With dead ends: 678 [2024-10-11 21:19:59,975 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 21:19:59,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:19:59,977 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 394 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:59,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 774 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:19:59,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 21:20:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 347. [2024-10-11 21:20:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 283 states have (on average 1.5371024734982333) internal successors, (435), 291 states have internal predecessors, (435), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-11 21:20:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 516 transitions. [2024-10-11 21:20:00,042 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 516 transitions. Word has length 59 [2024-10-11 21:20:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:00,043 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 516 transitions. [2024-10-11 21:20:00,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 516 transitions. [2024-10-11 21:20:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:20:00,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:00,045 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] [2024-10-11 21:20:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:20:00,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:00,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2114515562, now seen corresponding path program 1 times [2024-10-11 21:20:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156448134] [2024-10-11 21:20:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156448134] [2024-10-11 21:20:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156448134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:00,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:00,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:20:00,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727859478] [2024-10-11 21:20:00,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:00,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:00,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:00,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:00,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:00,185 INFO L87 Difference]: Start difference. First operand 347 states and 516 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:01,058 INFO L93 Difference]: Finished difference Result 1054 states and 1586 transitions. [2024-10-11 21:20:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:20:01,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:20:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:01,066 INFO L225 Difference]: With dead ends: 1054 [2024-10-11 21:20:01,066 INFO L226 Difference]: Without dead ends: 715 [2024-10-11 21:20:01,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:20:01,072 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 430 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:01,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 510 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:20:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-11 21:20:01,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 562. [2024-10-11 21:20:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 462 states have (on average 1.5281385281385282) internal successors, (706), 472 states have internal predecessors, (706), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-11 21:20:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 839 transitions. [2024-10-11 21:20:01,131 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 839 transitions. Word has length 59 [2024-10-11 21:20:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:01,131 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 839 transitions. [2024-10-11 21:20:01,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 839 transitions. [2024-10-11 21:20:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:20:01,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:01,135 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] [2024-10-11 21:20:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:20:01,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:01,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1827363352, now seen corresponding path program 1 times [2024-10-11 21:20:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:01,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058437012] [2024-10-11 21:20:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:01,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:01,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058437012] [2024-10-11 21:20:01,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058437012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:01,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:01,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:20:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790293446] [2024-10-11 21:20:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:01,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:01,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:01,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:01,259 INFO L87 Difference]: Start difference. First operand 562 states and 839 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:02,305 INFO L93 Difference]: Finished difference Result 1862 states and 2811 transitions. [2024-10-11 21:20:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:20:02,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:20:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:02,315 INFO L225 Difference]: With dead ends: 1862 [2024-10-11 21:20:02,315 INFO L226 Difference]: Without dead ends: 1308 [2024-10-11 21:20:02,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:20:02,322 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 402 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:02,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 761 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 21:20:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-10-11 21:20:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 962. [2024-10-11 21:20:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 794 states have (on average 1.5239294710327456) internal successors, (1210), 808 states have internal predecessors, (1210), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2024-10-11 21:20:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1445 transitions. [2024-10-11 21:20:02,413 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1445 transitions. Word has length 59 [2024-10-11 21:20:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:02,413 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1445 transitions. [2024-10-11 21:20:02,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1445 transitions. [2024-10-11 21:20:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:20:02,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:02,415 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] [2024-10-11 21:20:02,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:20:02,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:02,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1574117606, now seen corresponding path program 1 times [2024-10-11 21:20:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318825114] [2024-10-11 21:20:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:02,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318825114] [2024-10-11 21:20:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318825114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:02,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:20:02,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443734638] [2024-10-11 21:20:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:02,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:02,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:02,555 INFO L87 Difference]: Start difference. First operand 962 states and 1445 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:03,599 INFO L93 Difference]: Finished difference Result 3208 states and 4847 transitions. [2024-10-11 21:20:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:20:03,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:20:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:03,614 INFO L225 Difference]: With dead ends: 3208 [2024-10-11 21:20:03,614 INFO L226 Difference]: Without dead ends: 2254 [2024-10-11 21:20:03,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:20:03,619 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 402 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:03,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 762 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:20:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2024-10-11 21:20:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1771. [2024-10-11 21:20:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1471 states have (on average 1.5173351461590754) internal successors, (2232), 1493 states have internal predecessors, (2232), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2024-10-11 21:20:03,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2681 transitions. [2024-10-11 21:20:03,753 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2681 transitions. Word has length 59 [2024-10-11 21:20:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:03,754 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2681 transitions. [2024-10-11 21:20:03,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:03,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2681 transitions. [2024-10-11 21:20:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:20:03,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:03,758 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] [2024-10-11 21:20:03,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:20:03,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash 671461848, now seen corresponding path program 1 times [2024-10-11 21:20:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416979358] [2024-10-11 21:20:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416979358] [2024-10-11 21:20:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416979358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727630602] [2024-10-11 21:20:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:03,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:03,854 INFO L87 Difference]: Start difference. First operand 1771 states and 2681 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:04,756 INFO L93 Difference]: Finished difference Result 4972 states and 7568 transitions. [2024-10-11 21:20:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:20:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-11 21:20:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:04,773 INFO L225 Difference]: With dead ends: 4972 [2024-10-11 21:20:04,774 INFO L226 Difference]: Without dead ends: 3210 [2024-10-11 21:20:04,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:04,784 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 532 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:04,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 562 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:20:04,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2024-10-11 21:20:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2671. [2024-10-11 21:20:04,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2213 states have (on average 1.5011296882060552) internal successors, (3322), 2252 states have internal predecessors, (3322), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-11 21:20:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3991 transitions. [2024-10-11 21:20:04,980 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3991 transitions. Word has length 59 [2024-10-11 21:20:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:04,985 INFO L471 AbstractCegarLoop]: Abstraction has 2671 states and 3991 transitions. [2024-10-11 21:20:04,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3991 transitions. [2024-10-11 21:20:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:04,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:04,989 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] [2024-10-11 21:20:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:20:04,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1338873176, now seen corresponding path program 1 times [2024-10-11 21:20:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:04,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610710330] [2024-10-11 21:20:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:05,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:05,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610710330] [2024-10-11 21:20:05,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610710330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:05,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129406283] [2024-10-11 21:20:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:05,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:05,123 INFO L87 Difference]: Start difference. First operand 2671 states and 3991 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:05,830 INFO L93 Difference]: Finished difference Result 5775 states and 8750 transitions. [2024-10-11 21:20:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:20:05,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:05,848 INFO L225 Difference]: With dead ends: 5775 [2024-10-11 21:20:05,849 INFO L226 Difference]: Without dead ends: 3113 [2024-10-11 21:20:05,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:05,860 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 136 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:05,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 436 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2024-10-11 21:20:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2689. [2024-10-11 21:20:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2231 states have (on average 1.4894666069027342) internal successors, (3323), 2270 states have internal predecessors, (3323), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-11 21:20:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3992 transitions. [2024-10-11 21:20:06,076 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3992 transitions. Word has length 60 [2024-10-11 21:20:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:06,077 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 3992 transitions. [2024-10-11 21:20:06,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3992 transitions. [2024-10-11 21:20:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:06,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:06,081 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] [2024-10-11 21:20:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:20:06,081 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:06,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1998404698, now seen corresponding path program 1 times [2024-10-11 21:20:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604491162] [2024-10-11 21:20:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604491162] [2024-10-11 21:20:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604491162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628727591] [2024-10-11 21:20:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:06,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:06,204 INFO L87 Difference]: Start difference. First operand 2689 states and 3992 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:06,851 INFO L93 Difference]: Finished difference Result 5863 states and 8830 transitions. [2024-10-11 21:20:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:06,870 INFO L225 Difference]: With dead ends: 5863 [2024-10-11 21:20:06,870 INFO L226 Difference]: Without dead ends: 3183 [2024-10-11 21:20:06,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:06,880 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 147 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:06,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 436 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2024-10-11 21:20:07,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2741. [2024-10-11 21:20:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2283 states have (on average 1.4783180026281209) internal successors, (3375), 2322 states have internal predecessors, (3375), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-11 21:20:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4044 transitions. [2024-10-11 21:20:07,089 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4044 transitions. Word has length 60 [2024-10-11 21:20:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:07,089 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4044 transitions. [2024-10-11 21:20:07,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4044 transitions. [2024-10-11 21:20:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:07,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:07,094 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] [2024-10-11 21:20:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:20:07,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:07,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2021802984, now seen corresponding path program 1 times [2024-10-11 21:20:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592590269] [2024-10-11 21:20:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592590269] [2024-10-11 21:20:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592590269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:07,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:07,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:20:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384856650] [2024-10-11 21:20:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:07,213 INFO L87 Difference]: Start difference. First operand 2741 states and 4044 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:08,794 INFO L93 Difference]: Finished difference Result 9850 states and 14822 transitions. [2024-10-11 21:20:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:08,832 INFO L225 Difference]: With dead ends: 9850 [2024-10-11 21:20:08,832 INFO L226 Difference]: Without dead ends: 7118 [2024-10-11 21:20:08,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 21:20:08,842 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1009 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:08,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 603 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 21:20:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7118 states. [2024-10-11 21:20:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7118 to 6117. [2024-10-11 21:20:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 5087 states have (on average 1.4643208177707883) internal successors, (7449), 5185 states have internal predecessors, (7449), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2024-10-11 21:20:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 9041 transitions. [2024-10-11 21:20:09,309 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 9041 transitions. Word has length 60 [2024-10-11 21:20:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:09,310 INFO L471 AbstractCegarLoop]: Abstraction has 6117 states and 9041 transitions. [2024-10-11 21:20:09,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 9041 transitions. [2024-10-11 21:20:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:09,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:09,314 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] [2024-10-11 21:20:09,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:20:09,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:09,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2078947209, now seen corresponding path program 1 times [2024-10-11 21:20:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103320321] [2024-10-11 21:20:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:09,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:09,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:09,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103320321] [2024-10-11 21:20:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103320321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:09,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:09,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921117535] [2024-10-11 21:20:09,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:09,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:09,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:09,406 INFO L87 Difference]: Start difference. First operand 6117 states and 9041 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:10,377 INFO L93 Difference]: Finished difference Result 13278 states and 20073 transitions. [2024-10-11 21:20:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:10,425 INFO L225 Difference]: With dead ends: 13278 [2024-10-11 21:20:10,425 INFO L226 Difference]: Without dead ends: 7170 [2024-10-11 21:20:10,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:20:10,445 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:10,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 431 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:20:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2024-10-11 21:20:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6187. [2024-10-11 21:20:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 5157 states have (on average 1.4529765367461702) internal successors, (7493), 5255 states have internal predecessors, (7493), 606 states have call successors, (606), 362 states have call predecessors, (606), 418 states have return successors, (986), 585 states have call predecessors, (986), 606 states have call successors, (986) [2024-10-11 21:20:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 9085 transitions. [2024-10-11 21:20:10,942 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 9085 transitions. Word has length 60 [2024-10-11 21:20:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:10,943 INFO L471 AbstractCegarLoop]: Abstraction has 6187 states and 9085 transitions. [2024-10-11 21:20:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 9085 transitions. [2024-10-11 21:20:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:10,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:10,946 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] [2024-10-11 21:20:10,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 21:20:10,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash -155719175, now seen corresponding path program 1 times [2024-10-11 21:20:10,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:10,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734943779] [2024-10-11 21:20:10,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:11,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:11,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734943779] [2024-10-11 21:20:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734943779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:11,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662873750] [2024-10-11 21:20:11,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:11,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:11,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:11,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:11,077 INFO L87 Difference]: Start difference. First operand 6187 states and 9085 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:12,060 INFO L93 Difference]: Finished difference Result 8113 states and 11998 transitions. [2024-10-11 21:20:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 21:20:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:12,088 INFO L225 Difference]: With dead ends: 8113 [2024-10-11 21:20:12,088 INFO L226 Difference]: Without dead ends: 4669 [2024-10-11 21:20:12,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:20:12,100 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 525 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:12,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 565 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:20:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2024-10-11 21:20:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 3821. [2024-10-11 21:20:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3174 states have (on average 1.4350976685570258) internal successors, (4555), 3232 states have internal predecessors, (4555), 387 states have call successors, (387), 226 states have call predecessors, (387), 254 states have return successors, (556), 370 states have call predecessors, (556), 387 states have call successors, (556) [2024-10-11 21:20:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5498 transitions. [2024-10-11 21:20:12,415 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5498 transitions. Word has length 60 [2024-10-11 21:20:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:12,416 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 5498 transitions. [2024-10-11 21:20:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5498 transitions. [2024-10-11 21:20:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:12,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:12,418 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] [2024-10-11 21:20:12,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 21:20:12,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:12,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash 63135543, now seen corresponding path program 1 times [2024-10-11 21:20:12,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:12,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294509993] [2024-10-11 21:20:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:12,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:12,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294509993] [2024-10-11 21:20:12,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294509993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:12,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:12,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:12,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688314139] [2024-10-11 21:20:12,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:12,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:12,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:12,551 INFO L87 Difference]: Start difference. First operand 3821 states and 5498 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:13,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:13,979 INFO L93 Difference]: Finished difference Result 11820 states and 17174 transitions. [2024-10-11 21:20:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:13,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:13,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:14,013 INFO L225 Difference]: With dead ends: 11820 [2024-10-11 21:20:14,013 INFO L226 Difference]: Without dead ends: 8009 [2024-10-11 21:20:14,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-10-11 21:20:14,028 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 554 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:14,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 564 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:20:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8009 states. [2024-10-11 21:20:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8009 to 6565. [2024-10-11 21:20:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6565 states, 5447 states have (on average 1.416926748668992) internal successors, (7718), 5572 states have internal predecessors, (7718), 643 states have call successors, (643), 390 states have call predecessors, (643), 469 states have return successors, (994), 618 states have call predecessors, (994), 643 states have call successors, (994) [2024-10-11 21:20:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6565 states to 6565 states and 9355 transitions. [2024-10-11 21:20:14,578 INFO L78 Accepts]: Start accepts. Automaton has 6565 states and 9355 transitions. Word has length 60 [2024-10-11 21:20:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:14,579 INFO L471 AbstractCegarLoop]: Abstraction has 6565 states and 9355 transitions. [2024-10-11 21:20:14,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 6565 states and 9355 transitions. [2024-10-11 21:20:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:14,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:14,581 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] [2024-10-11 21:20:14,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:20:14,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:14,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash -754512907, now seen corresponding path program 1 times [2024-10-11 21:20:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918998471] [2024-10-11 21:20:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:14,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:14,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:14,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918998471] [2024-10-11 21:20:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918998471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469509735] [2024-10-11 21:20:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:14,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:14,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:14,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:14,711 INFO L87 Difference]: Start difference. First operand 6565 states and 9355 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:15,803 INFO L93 Difference]: Finished difference Result 12056 states and 17144 transitions. [2024-10-11 21:20:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:15,834 INFO L225 Difference]: With dead ends: 12056 [2024-10-11 21:20:15,834 INFO L226 Difference]: Without dead ends: 6941 [2024-10-11 21:20:15,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-10-11 21:20:15,850 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 603 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:15,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 496 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:20:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2024-10-11 21:20:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 5433. [2024-10-11 21:20:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5433 states, 4527 states have (on average 1.3943008614976806) internal successors, (6312), 4628 states have internal predecessors, (6312), 519 states have call successors, (519), 326 states have call predecessors, (519), 381 states have return successors, (774), 486 states have call predecessors, (774), 519 states have call successors, (774) [2024-10-11 21:20:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 7605 transitions. [2024-10-11 21:20:16,335 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 7605 transitions. Word has length 60 [2024-10-11 21:20:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:16,337 INFO L471 AbstractCegarLoop]: Abstraction has 5433 states and 7605 transitions. [2024-10-11 21:20:16,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 7605 transitions. [2024-10-11 21:20:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:16,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:16,339 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] [2024-10-11 21:20:16,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:20:16,339 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:16,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1851510647, now seen corresponding path program 1 times [2024-10-11 21:20:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065841100] [2024-10-11 21:20:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:16,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:16,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065841100] [2024-10-11 21:20:16,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065841100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:16,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:16,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287058557] [2024-10-11 21:20:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:16,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:16,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:16,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:16,474 INFO L87 Difference]: Start difference. First operand 5433 states and 7605 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:17,555 INFO L93 Difference]: Finished difference Result 10188 states and 14365 transitions. [2024-10-11 21:20:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:17,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:17,585 INFO L225 Difference]: With dead ends: 10188 [2024-10-11 21:20:17,585 INFO L226 Difference]: Without dead ends: 6891 [2024-10-11 21:20:17,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-10-11 21:20:17,597 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 649 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:17,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 493 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6891 states. [2024-10-11 21:20:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6891 to 5400. [2024-10-11 21:20:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5400 states, 4504 states have (on average 1.3872113676731794) internal successors, (6248), 4595 states have internal predecessors, (6248), 519 states have call successors, (519), 326 states have call predecessors, (519), 371 states have return successors, (730), 482 states have call predecessors, (730), 519 states have call successors, (730) [2024-10-11 21:20:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 7497 transitions. [2024-10-11 21:20:18,241 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 7497 transitions. Word has length 60 [2024-10-11 21:20:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 5400 states and 7497 transitions. [2024-10-11 21:20:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 7497 transitions. [2024-10-11 21:20:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 21:20:18,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:18,243 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] [2024-10-11 21:20:18,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:20:18,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -142634059, now seen corresponding path program 1 times [2024-10-11 21:20:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29267778] [2024-10-11 21:20:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29267778] [2024-10-11 21:20:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29267778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007585823] [2024-10-11 21:20:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:18,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:18,326 INFO L87 Difference]: Start difference. First operand 5400 states and 7497 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:19,433 INFO L93 Difference]: Finished difference Result 15358 states and 21727 transitions. [2024-10-11 21:20:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:20:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 60 [2024-10-11 21:20:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:19,474 INFO L225 Difference]: With dead ends: 15358 [2024-10-11 21:20:19,474 INFO L226 Difference]: Without dead ends: 9970 [2024-10-11 21:20:19,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:19,490 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 468 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:19,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 378 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2024-10-11 21:20:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 8412. [2024-10-11 21:20:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8412 states, 7020 states have (on average 1.3749287749287749) internal successors, (9652), 7148 states have internal predecessors, (9652), 788 states have call successors, (788), 506 states have call predecessors, (788), 598 states have return successors, (1266), 761 states have call predecessors, (1266), 788 states have call successors, (1266) [2024-10-11 21:20:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8412 states to 8412 states and 11706 transitions. [2024-10-11 21:20:20,198 INFO L78 Accepts]: Start accepts. Automaton has 8412 states and 11706 transitions. Word has length 60 [2024-10-11 21:20:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:20,199 INFO L471 AbstractCegarLoop]: Abstraction has 8412 states and 11706 transitions. [2024-10-11 21:20:20,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8412 states and 11706 transitions. [2024-10-11 21:20:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 21:20:20,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:20,200 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] [2024-10-11 21:20:20,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:20:20,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1969753673, now seen corresponding path program 1 times [2024-10-11 21:20:20,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:20,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652190194] [2024-10-11 21:20:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:20,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:20,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652190194] [2024-10-11 21:20:20,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652190194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:20,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:20,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303900132] [2024-10-11 21:20:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:20,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:20,267 INFO L87 Difference]: Start difference. First operand 8412 states and 11706 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 21:20:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:21,656 INFO L93 Difference]: Finished difference Result 23750 states and 33333 transitions. [2024-10-11 21:20:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:21,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-10-11 21:20:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:21,724 INFO L225 Difference]: With dead ends: 23750 [2024-10-11 21:20:21,724 INFO L226 Difference]: Without dead ends: 15260 [2024-10-11 21:20:21,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:21,748 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 459 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:21,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 318 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:20:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2024-10-11 21:20:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 12980. [2024-10-11 21:20:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12980 states, 10804 states have (on average 1.356164383561644) internal successors, (14652), 11002 states have internal predecessors, (14652), 1224 states have call successors, (1224), 800 states have call predecessors, (1224), 946 states have return successors, (1951), 1181 states have call predecessors, (1951), 1224 states have call successors, (1951) [2024-10-11 21:20:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12980 states to 12980 states and 17827 transitions. [2024-10-11 21:20:23,214 INFO L78 Accepts]: Start accepts. Automaton has 12980 states and 17827 transitions. Word has length 62 [2024-10-11 21:20:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:23,215 INFO L471 AbstractCegarLoop]: Abstraction has 12980 states and 17827 transitions. [2024-10-11 21:20:23,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 21:20:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12980 states and 17827 transitions. [2024-10-11 21:20:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 21:20:23,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:23,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 21:20:23,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 21:20:23,220 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2115358801, now seen corresponding path program 1 times [2024-10-11 21:20:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:23,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534196924] [2024-10-11 21:20:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:20:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534196924] [2024-10-11 21:20:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534196924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603127390] [2024-10-11 21:20:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:23,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:23,328 INFO L87 Difference]: Start difference. First operand 12980 states and 17827 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:20:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:25,758 INFO L93 Difference]: Finished difference Result 42794 states and 59323 transitions. [2024-10-11 21:20:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:20:25,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 80 [2024-10-11 21:20:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:25,883 INFO L225 Difference]: With dead ends: 42794 [2024-10-11 21:20:25,884 INFO L226 Difference]: Without dead ends: 29826 [2024-10-11 21:20:25,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:25,925 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 549 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:25,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 368 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29826 states. [2024-10-11 21:20:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29826 to 25522. [2024-10-11 21:20:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25522 states, 21085 states have (on average 1.3373962532606118) internal successors, (28199), 21588 states have internal predecessors, (28199), 2379 states have call successors, (2379), 1582 states have call predecessors, (2379), 2052 states have return successors, (4447), 2359 states have call predecessors, (4447), 2379 states have call successors, (4447) [2024-10-11 21:20:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25522 states to 25522 states and 35025 transitions. [2024-10-11 21:20:28,245 INFO L78 Accepts]: Start accepts. Automaton has 25522 states and 35025 transitions. Word has length 80 [2024-10-11 21:20:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:28,246 INFO L471 AbstractCegarLoop]: Abstraction has 25522 states and 35025 transitions. [2024-10-11 21:20:28,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:20:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 25522 states and 35025 transitions. [2024-10-11 21:20:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 21:20:28,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:28,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 21:20:28,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 21:20:28,252 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-11 21:20:28,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 268565937, now seen corresponding path program 1 times [2024-10-11 21:20:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903010859] [2024-10-11 21:20:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:20:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 21:20:28,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:28,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903010859] [2024-10-11 21:20:28,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903010859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:28,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907847547] [2024-10-11 21:20:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:28,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:28,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:28,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:28,337 INFO L87 Difference]: Start difference. First operand 25522 states and 35025 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:31,282 INFO L93 Difference]: Finished difference Result 53346 states and 73835 transitions. [2024-10-11 21:20:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-11 21:20:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:31,396 INFO L225 Difference]: With dead ends: 53346 [2024-10-11 21:20:31,396 INFO L226 Difference]: Without dead ends: 27836 [2024-10-11 21:20:31,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:31,444 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 354 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:31,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 237 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:20:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2024-10-11 21:20:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 23840. [2024-10-11 21:20:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23840 states, 19698 states have (on average 1.343994314143568) internal successors, (26474), 20170 states have internal predecessors, (26474), 2216 states have call successors, (2216), 1464 states have call predecessors, (2216), 1920 states have return successors, (4255), 2209 states have call predecessors, (4255), 2216 states have call successors, (4255) [2024-10-11 21:20:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23840 states to 23840 states and 32945 transitions. [2024-10-11 21:20:33,797 INFO L78 Accepts]: Start accepts. Automaton has 23840 states and 32945 transitions. Word has length 80 [2024-10-11 21:20:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:33,797 INFO L471 AbstractCegarLoop]: Abstraction has 23840 states and 32945 transitions. [2024-10-11 21:20:33,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23840 states and 32945 transitions. [2024-10-11 21:20:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 21:20:33,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:33,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 21:20:33,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 21:20:33,801 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-10-11 21:20:33,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1844874981, now seen corresponding path program 1 times [2024-10-11 21:20:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610180090] [2024-10-11 21:20:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:20:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 21:20:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:33,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610180090] [2024-10-11 21:20:33,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610180090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:33,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493948376] [2024-10-11 21:20:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:33,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:33,887 INFO L87 Difference]: Start difference. First operand 23840 states and 32945 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:20:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:38,850 INFO L93 Difference]: Finished difference Result 77431 states and 107839 transitions. [2024-10-11 21:20:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:20:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 81 [2024-10-11 21:20:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:39,113 INFO L225 Difference]: With dead ends: 77431 [2024-10-11 21:20:39,113 INFO L226 Difference]: Without dead ends: 53603 [2024-10-11 21:20:39,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:39,183 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 535 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:39,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 444 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:39,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53603 states. [2024-10-11 21:20:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53603 to 48335. [2024-10-11 21:20:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48335 states, 39808 states have (on average 1.324231310289389) internal successors, (52715), 41017 states have internal predecessors, (52715), 4299 states have call successors, (4299), 2886 states have call predecessors, (4299), 4222 states have return successors, (9590), 4439 states have call predecessors, (9590), 4299 states have call successors, (9590) [2024-10-11 21:20:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48335 states to 48335 states and 66604 transitions. [2024-10-11 21:20:44,186 INFO L78 Accepts]: Start accepts. Automaton has 48335 states and 66604 transitions. Word has length 81 [2024-10-11 21:20:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:44,186 INFO L471 AbstractCegarLoop]: Abstraction has 48335 states and 66604 transitions. [2024-10-11 21:20:44,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:20:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48335 states and 66604 transitions. [2024-10-11 21:20:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 21:20:44,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:44,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 21:20:44,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 21:20:44,190 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-10-11 21:20:44,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -715987865, now seen corresponding path program 1 times [2024-10-11 21:20:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079963773] [2024-10-11 21:20:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 21:20:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 21:20:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:20:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:20:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:20:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 21:20:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:44,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079963773] [2024-10-11 21:20:44,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079963773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:44,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:44,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:44,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26971279] [2024-10-11 21:20:44,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:44,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:44,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:44,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:44,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:44,249 INFO L87 Difference]: Start difference. First operand 48335 states and 66604 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)