./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96484bfe2125966f3f858294999ba06e5bcb55d577c4089dc42afb40d58fe9d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:02:29,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:02:29,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:02:29,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:02:29,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:02:29,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:02:29,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:02:29,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:02:29,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:02:29,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:02:29,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:02:29,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:02:29,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:02:29,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:02:29,420 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:02:29,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:02:29,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:02:29,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:02:29,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:02:29,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:02:29,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:02:29,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:02:29,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:02:29,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:02:29,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:02:29,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:02:29,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:02:29,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:02:29,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:02:29,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:02:29,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:02:29,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:02:29,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:29,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:02:29,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:02:29,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:02:29,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:02:29,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:02:29,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:02:29,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:02:29,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:02:29,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:02:29,432 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 96484bfe2125966f3f858294999ba06e5bcb55d577c4089dc42afb40d58fe9d6 [2024-10-24 11:02:29,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:02:29,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:02:29,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:02:29,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:02:29,742 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:02:29,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i [2024-10-24 11:02:31,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:02:31,410 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:02:31,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i [2024-10-24 11:02:31,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69d8d3df/f2c1e0c1884749de8c726638f026749d/FLAGb878b2341 [2024-10-24 11:02:31,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69d8d3df/f2c1e0c1884749de8c726638f026749d [2024-10-24 11:02:31,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:02:31,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:02:31,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:31,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:02:31,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:02:31,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:31" (1/1) ... [2024-10-24 11:02:31,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c03fccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:31, skipping insertion in model container [2024-10-24 11:02:31,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:31" (1/1) ... [2024-10-24 11:02:31,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:02:32,002 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i[913,926] [2024-10-24 11:02:32,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:32,084 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:02:32,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i[913,926] [2024-10-24 11:02:32,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:32,143 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:02:32,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32 WrapperNode [2024-10-24 11:02:32,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:32,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:32,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:02:32,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:02:32,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,195 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-24 11:02:32,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:32,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:02:32,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:02:32,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:02:32,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,235 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-24 11:02:32,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:02:32,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:02:32,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:02:32,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:02:32,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (1/1) ... [2024-10-24 11:02:32,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:32,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:02:32,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:02:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:02:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:02:32,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:02:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:02:32,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:02:32,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:02:32,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:02:32,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:02:32,893 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-24 11:02:32,893 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:02:32,921 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:02:32,922 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:02:32,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:32 BoogieIcfgContainer [2024-10-24 11:02:32,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:02:32,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:02:32,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:02:32,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:02:32,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:02:31" (1/3) ... [2024-10-24 11:02:32,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2365aed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:32, skipping insertion in model container [2024-10-24 11:02:32,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:32" (2/3) ... [2024-10-24 11:02:32,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2365aed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:32, skipping insertion in model container [2024-10-24 11:02:32,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:32" (3/3) ... [2024-10-24 11:02:32,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-18.i [2024-10-24 11:02:32,948 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:02:32,948 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:02:33,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:02:33,013 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;@4708968a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:02:33,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:02:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:02:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 11:02:33,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:33,030 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:33,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:33,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -248618933, now seen corresponding path program 1 times [2024-10-24 11:02:33,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:33,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369568965] [2024-10-24 11:02:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369568965] [2024-10-24 11:02:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369568965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:02:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392196535] [2024-10-24 11:02:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:33,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:02:33,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:33,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:02:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:33,393 INFO L87 Difference]: Start difference. First operand has 58 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 44 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:02:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:33,436 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-10-24 11:02:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:02:33,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-10-24 11:02:33,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:33,446 INFO L225 Difference]: With dead ends: 113 [2024-10-24 11:02:33,446 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 11:02:33,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:33,453 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:33,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:02:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 11:02:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 11:02:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:02:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-10-24 11:02:33,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 83 [2024-10-24 11:02:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-10-24 11:02:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:02:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-10-24 11:02:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 11:02:33,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:33,511 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:33,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:02:33,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -192998257, now seen corresponding path program 1 times [2024-10-24 11:02:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309537415] [2024-10-24 11:02:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:34,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309537415] [2024-10-24 11:02:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309537415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:02:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59305396] [2024-10-24 11:02:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:34,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:02:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:02:34,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:34,059 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:34,242 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2024-10-24 11:02:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:02:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-10-24 11:02:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:34,248 INFO L225 Difference]: With dead ends: 166 [2024-10-24 11:02:34,248 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:02:34,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:34,251 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 53 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:34,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:02:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:02:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-10-24 11:02:34,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.382716049382716) internal successors, (112), 81 states have internal predecessors, (112), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:02:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2024-10-24 11:02:34,283 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 83 [2024-10-24 11:02:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:34,284 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2024-10-24 11:02:34,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2024-10-24 11:02:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:02:34,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:34,287 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:34,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:02:34,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 856344608, now seen corresponding path program 1 times [2024-10-24 11:02:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411649802] [2024-10-24 11:02:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:34,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:02:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411649802] [2024-10-24 11:02:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411649802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:02:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092037265] [2024-10-24 11:02:34,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:34,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:02:34,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:34,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:02:34,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:02:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:35,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:02:35,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:02:35,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:02:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:02:36,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092037265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:02:36,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:02:36,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-10-24 11:02:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757383116] [2024-10-24 11:02:36,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:02:36,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 11:02:36,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 11:02:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:02:36,030 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-24 11:02:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:36,972 INFO L93 Difference]: Finished difference Result 352 states and 507 transitions. [2024-10-24 11:02:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 11:02:36,973 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 84 [2024-10-24 11:02:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:36,976 INFO L225 Difference]: With dead ends: 352 [2024-10-24 11:02:36,976 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 11:02:36,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 11:02:36,979 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 471 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:36,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 280 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:02:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 11:02:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2024-10-24 11:02:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 178 states have (on average 1.2359550561797752) internal successors, (220), 178 states have internal predecessors, (220), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:02:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 316 transitions. [2024-10-24 11:02:37,014 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 316 transitions. Word has length 84 [2024-10-24 11:02:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:37,015 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 316 transitions. [2024-10-24 11:02:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-10-24 11:02:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 316 transitions. [2024-10-24 11:02:37,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:02:37,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:37,018 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:37,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:02:37,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:02:37,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:37,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:37,224 INFO L85 PathProgramCache]: Analyzing trace with hash -882754662, now seen corresponding path program 1 times [2024-10-24 11:02:37,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:37,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421442522] [2024-10-24 11:02:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421442522] [2024-10-24 11:02:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421442522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:02:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272911879] [2024-10-24 11:02:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:40,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:02:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:40,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:02:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:02:40,449 INFO L87 Difference]: Start difference. First operand 235 states and 316 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:42,845 INFO L93 Difference]: Finished difference Result 625 states and 822 transitions. [2024-10-24 11:02:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:02:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:02:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:42,852 INFO L225 Difference]: With dead ends: 625 [2024-10-24 11:02:42,855 INFO L226 Difference]: Without dead ends: 391 [2024-10-24 11:02:42,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-10-24 11:02:42,860 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 361 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:42,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 464 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:02:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-24 11:02:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 247. [2024-10-24 11:02:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.2263157894736842) internal successors, (233), 190 states have internal predecessors, (233), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:02:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 329 transitions. [2024-10-24 11:02:42,923 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 329 transitions. Word has length 85 [2024-10-24 11:02:42,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:42,924 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 329 transitions. [2024-10-24 11:02:42,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 329 transitions. [2024-10-24 11:02:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 11:02:42,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:42,929 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:42,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:02:42,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2132348956, now seen corresponding path program 1 times [2024-10-24 11:02:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733226321] [2024-10-24 11:02:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:44,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733226321] [2024-10-24 11:02:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733226321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:44,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:44,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:02:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52869718] [2024-10-24 11:02:44,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:44,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:02:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:02:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:02:44,444 INFO L87 Difference]: Start difference. First operand 247 states and 329 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:45,740 INFO L93 Difference]: Finished difference Result 417 states and 545 transitions. [2024-10-24 11:02:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 11:02:45,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-24 11:02:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:45,745 INFO L225 Difference]: With dead ends: 417 [2024-10-24 11:02:45,745 INFO L226 Difference]: Without dead ends: 356 [2024-10-24 11:02:45,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:02:45,749 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 179 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:45,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 324 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:02:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-24 11:02:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 252. [2024-10-24 11:02:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 195 states have (on average 1.235897435897436) internal successors, (241), 195 states have internal predecessors, (241), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:02:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 337 transitions. [2024-10-24 11:02:45,780 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 337 transitions. Word has length 85 [2024-10-24 11:02:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:45,780 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 337 transitions. [2024-10-24 11:02:45,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 337 transitions. [2024-10-24 11:02:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:02:45,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:45,784 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:45,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:02:45,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1779344867, now seen corresponding path program 1 times [2024-10-24 11:02:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967142764] [2024-10-24 11:02:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967142764] [2024-10-24 11:02:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967142764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:45,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:02:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758564950] [2024-10-24 11:02:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:45,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:02:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:45,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:02:45,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:45,909 INFO L87 Difference]: Start difference. First operand 252 states and 337 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:45,943 INFO L93 Difference]: Finished difference Result 509 states and 685 transitions. [2024-10-24 11:02:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:02:45,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-10-24 11:02:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:45,948 INFO L225 Difference]: With dead ends: 509 [2024-10-24 11:02:45,948 INFO L226 Difference]: Without dead ends: 258 [2024-10-24 11:02:45,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:45,949 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:45,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:02:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-24 11:02:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2024-10-24 11:02:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 198 states have (on average 1.2323232323232323) internal successors, (244), 198 states have internal predecessors, (244), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:02:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 340 transitions. [2024-10-24 11:02:46,015 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 340 transitions. Word has length 86 [2024-10-24 11:02:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 340 transitions. [2024-10-24 11:02:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 340 transitions. [2024-10-24 11:02:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:02:46,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:46,018 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:46,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:02:46,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1581994335, now seen corresponding path program 1 times [2024-10-24 11:02:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258152143] [2024-10-24 11:02:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:46,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:46,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258152143] [2024-10-24 11:02:46,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258152143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:46,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:46,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:02:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509598881] [2024-10-24 11:02:46,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:46,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:02:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:02:46,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:02:46,383 INFO L87 Difference]: Start difference. First operand 255 states and 340 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:46,504 INFO L93 Difference]: Finished difference Result 311 states and 406 transitions. [2024-10-24 11:02:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:02:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-10-24 11:02:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:46,507 INFO L225 Difference]: With dead ends: 311 [2024-10-24 11:02:46,508 INFO L226 Difference]: Without dead ends: 309 [2024-10-24 11:02:46,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:02:46,510 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:46,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 218 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:02:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-24 11:02:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 299. [2024-10-24 11:02:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 242 states have (on average 1.2231404958677685) internal successors, (296), 242 states have internal predecessors, (296), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 11:02:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 392 transitions. [2024-10-24 11:02:46,541 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 392 transitions. Word has length 87 [2024-10-24 11:02:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:46,541 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 392 transitions. [2024-10-24 11:02:46,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 392 transitions. [2024-10-24 11:02:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:02:46,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:46,543 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:46,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:02:46,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:46,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1888548291, now seen corresponding path program 1 times [2024-10-24 11:02:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39724873] [2024-10-24 11:02:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:46,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39724873] [2024-10-24 11:02:46,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39724873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:46,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:46,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:02:46,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929504509] [2024-10-24 11:02:46,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:46,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:02:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:02:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:46,615 INFO L87 Difference]: Start difference. First operand 299 states and 392 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:46,722 INFO L93 Difference]: Finished difference Result 509 states and 674 transitions. [2024-10-24 11:02:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:02:46,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-10-24 11:02:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:46,725 INFO L225 Difference]: With dead ends: 509 [2024-10-24 11:02:46,725 INFO L226 Difference]: Without dead ends: 345 [2024-10-24 11:02:46,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:46,729 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:46,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 106 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:02:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-24 11:02:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 198. [2024-10-24 11:02:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.206451612903226) internal successors, (187), 155 states have internal predecessors, (187), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:02:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 259 transitions. [2024-10-24 11:02:46,752 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 259 transitions. Word has length 87 [2024-10-24 11:02:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:46,752 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 259 transitions. [2024-10-24 11:02:46,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 259 transitions. [2024-10-24 11:02:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 11:02:46,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:46,753 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:46,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:02:46,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:46,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:46,754 INFO L85 PathProgramCache]: Analyzing trace with hash 144118592, now seen corresponding path program 1 times [2024-10-24 11:02:46,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:46,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28064084] [2024-10-24 11:02:46,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28064084] [2024-10-24 11:02:46,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28064084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:46,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:46,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:02:46,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289031749] [2024-10-24 11:02:46,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:02:46,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:02:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:46,817 INFO L87 Difference]: Start difference. First operand 198 states and 259 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:46,893 INFO L93 Difference]: Finished difference Result 344 states and 448 transitions. [2024-10-24 11:02:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:02:46,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2024-10-24 11:02:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:46,895 INFO L225 Difference]: With dead ends: 344 [2024-10-24 11:02:46,896 INFO L226 Difference]: Without dead ends: 205 [2024-10-24 11:02:46,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:02:46,897 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:46,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:02:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-24 11:02:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-10-24 11:02:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.1823899371069182) internal successors, (188), 159 states have internal predecessors, (188), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:02:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 260 transitions. [2024-10-24 11:02:46,919 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 260 transitions. Word has length 88 [2024-10-24 11:02:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:46,919 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 260 transitions. [2024-10-24 11:02:46,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 260 transitions. [2024-10-24 11:02:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 11:02:46,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:46,921 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:46,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:02:46,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:46,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1160209684, now seen corresponding path program 1 times [2024-10-24 11:02:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682359019] [2024-10-24 11:02:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:02:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:02:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:02:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:02:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:02:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:02:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:02:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:02:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:02:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:02:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:02:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:02:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:02:47,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:02:47,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682359019] [2024-10-24 11:02:47,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682359019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:47,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:47,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:02:47,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47445683] [2024-10-24 11:02:47,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:47,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:02:47,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:02:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:02:47,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:02:47,446 INFO L87 Difference]: Start difference. First operand 202 states and 260 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:47,708 INFO L93 Difference]: Finished difference Result 367 states and 464 transitions. [2024-10-24 11:02:47,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:02:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-10-24 11:02:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:47,710 INFO L225 Difference]: With dead ends: 367 [2024-10-24 11:02:47,710 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 11:02:47,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:02:47,712 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:47,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 292 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:02:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 11:02:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 198. [2024-10-24 11:02:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.1612903225806452) internal successors, (180), 155 states have internal predecessors, (180), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 11:02:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2024-10-24 11:02:47,733 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 89 [2024-10-24 11:02:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:47,733 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2024-10-24 11:02:47,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:02:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2024-10-24 11:02:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:02:47,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:47,736 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:47,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:02:47,737 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:47,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1240561295, now seen corresponding path program 1 times [2024-10-24 11:02:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:02:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289669448] [2024-10-24 11:02:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:02:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:02:47,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102393920] [2024-10-24 11:02:47,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:02:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:47,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:02:47,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:02:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:02:47,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:02:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:02:47,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:02:47,985 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:02:47,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:02:48,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:02:48,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 11:02:48,192 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:02:48,250 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:02:48,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:02:48 BoogieIcfgContainer [2024-10-24 11:02:48,257 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:02:48,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:02:48,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:02:48,258 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:02:48,258 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:32" (3/4) ... [2024-10-24 11:02:48,262 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:02:48,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:02:48,264 INFO L158 Benchmark]: Toolchain (without parser) took 16479.41ms. Allocated memory was 151.0MB in the beginning and 356.5MB in the end (delta: 205.5MB). Free memory was 95.4MB in the beginning and 178.6MB in the end (delta: -83.2MB). Peak memory consumption was 125.4MB. Max. memory is 16.1GB. [2024-10-24 11:02:48,264 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:02:48,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.35ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 81.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:02:48,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 77.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:02:48,265 INFO L158 Benchmark]: Boogie Preprocessor took 63.82ms. Allocated memory is still 151.0MB. Free memory was 77.7MB in the beginning and 74.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:02:48,265 INFO L158 Benchmark]: RCFGBuilder took 661.02ms. Allocated memory is still 151.0MB. Free memory was 74.4MB in the beginning and 109.4MB in the end (delta: -35.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-10-24 11:02:48,266 INFO L158 Benchmark]: TraceAbstraction took 15332.75ms. Allocated memory was 151.0MB in the beginning and 356.5MB in the end (delta: 205.5MB). Free memory was 108.8MB in the beginning and 179.7MB in the end (delta: -70.9MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2024-10-24 11:02:48,266 INFO L158 Benchmark]: Witness Printer took 5.65ms. Allocated memory is still 356.5MB. Free memory was 179.7MB in the beginning and 178.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:02:48,267 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 151.0MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.35ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 81.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 77.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.82ms. Allocated memory is still 151.0MB. Free memory was 77.7MB in the beginning and 74.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 661.02ms. Allocated memory is still 151.0MB. Free memory was 74.4MB in the beginning and 109.4MB in the end (delta: -35.0MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15332.75ms. Allocated memory was 151.0MB in the beginning and 356.5MB in the end (delta: 205.5MB). Free memory was 108.8MB in the beginning and 179.7MB in the end (delta: -70.9MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. * Witness Printer took 5.65ms. Allocated memory is still 356.5MB. Free memory was 179.7MB in the beginning and 178.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of bitwiseOr at line 89, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] float var_1_9 = 5.8; [L26] float var_1_10 = 0.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_11 = var_1_11 [L86] last_1_var_1_14 = var_1_14 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L76] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L76] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L78] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L79] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L79] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L80] var_1_15 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L82] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L82] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L97] RET updateVariables() [L98] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L89] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L89-L90] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1279 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1279 mSDsluCounter, 2183 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1418 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2783 IncrementalHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 765 mSDtfsCounter, 2783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 445 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 1123 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 4359 SizeOfPredicates, 4 NumberOfNonLiveVariables, 208 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 3069/3168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:02:48,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 96484bfe2125966f3f858294999ba06e5bcb55d577c4089dc42afb40d58fe9d6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:02:50,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:02:50,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:02:50,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:02:50,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:02:50,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:02:50,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:02:50,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:02:50,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:02:50,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:02:50,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:02:50,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:02:50,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:02:50,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:02:50,721 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:02:50,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:02:50,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:02:50,722 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:02:50,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:02:50,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:02:50,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:02:50,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:02:50,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:02:50,727 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:02:50,727 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:02:50,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:02:50,727 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:02:50,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:02:50,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:02:50,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:02:50,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:02:50,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:02:50,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:02:50,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:02:50,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:50,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:02:50,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:02:50,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:02:50,739 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:02:50,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:02:50,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:02:50,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:02:50,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:02:50,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:02:50,741 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:02:50,741 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 96484bfe2125966f3f858294999ba06e5bcb55d577c4089dc42afb40d58fe9d6 [2024-10-24 11:02:51,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:02:51,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:02:51,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:02:51,102 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:02:51,102 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:02:51,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i [2024-10-24 11:02:52,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:02:52,927 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:02:52,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i [2024-10-24 11:02:52,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4a99604/541eb44411a34891bff87382efd13206/FLAG5ef801ccd [2024-10-24 11:02:52,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d4a99604/541eb44411a34891bff87382efd13206 [2024-10-24 11:02:52,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:02:52,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:02:52,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:52,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:02:52,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:02:52,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:52" (1/1) ... [2024-10-24 11:02:52,981 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a91ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:52, skipping insertion in model container [2024-10-24 11:02:52,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:02:52" (1/1) ... [2024-10-24 11:02:53,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:02:53,221 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i[913,926] [2024-10-24 11:02:53,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:53,302 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:02:53,316 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-18.i[913,926] [2024-10-24 11:02:53,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:02:53,374 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:02:53,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53 WrapperNode [2024-10-24 11:02:53,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:02:53,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:53,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:02:53,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:02:53,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,426 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-10-24 11:02:53,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:02:53,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:02:53,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:02:53,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:02:53,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,467 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-24 11:02:53,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:02:53,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:02:53,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:02:53,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:02:53,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (1/1) ... [2024-10-24 11:02:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:02:53,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:02:53,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:02:53,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:02:53,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:02:53,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:02:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:02:53,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:02:53,678 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:02:53,681 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:02:54,051 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 11:02:54,051 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:02:54,117 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:02:54,117 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:02:54,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:54 BoogieIcfgContainer [2024-10-24 11:02:54,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:02:54,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:02:54,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:02:54,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:02:54,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:02:52" (1/3) ... [2024-10-24 11:02:54,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e720825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:54, skipping insertion in model container [2024-10-24 11:02:54,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:02:53" (2/3) ... [2024-10-24 11:02:54,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e720825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:02:54, skipping insertion in model container [2024-10-24 11:02:54,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:02:54" (3/3) ... [2024-10-24 11:02:54,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-18.i [2024-10-24 11:02:54,146 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:02:54,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:02:54,214 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:02:54,222 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;@72a68ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:02:54,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:02:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:02:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 11:02:54,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:54,237 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:54,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:54,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1521500565, now seen corresponding path program 1 times [2024-10-24 11:02:54,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:54,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121084690] [2024-10-24 11:02:54,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:54,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:54,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:54,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:54,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:02:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:54,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:02:54,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-24 11:02:54,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:02:54,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:54,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121084690] [2024-10-24 11:02:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121084690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:02:54,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:02:54,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:02:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466387721] [2024-10-24 11:02:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:02:54,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:02:54,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:02:54,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:54,543 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:02:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:54,598 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2024-10-24 11:02:54,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:02:54,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2024-10-24 11:02:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:54,612 INFO L225 Difference]: With dead ends: 75 [2024-10-24 11:02:54,612 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 11:02:54,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:02:54,619 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:54,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:02:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 11:02:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 11:02:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:02:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-24 11:02:54,659 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 76 [2024-10-24 11:02:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-24 11:02:54,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:02:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-24 11:02:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 11:02:54,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:54,666 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:54,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:02:54,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:54,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:54,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1826328231, now seen corresponding path program 1 times [2024-10-24 11:02:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982006945] [2024-10-24 11:02:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:54,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:54,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:54,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:02:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:55,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:02:55,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:02:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:02:55,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:02:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-24 11:02:56,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:02:56,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982006945] [2024-10-24 11:02:56,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982006945] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:02:56,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:02:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-24 11:02:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85517398] [2024-10-24 11:02:56,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:02:56,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:02:56,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:02:56,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:02:56,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:02:56,310 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 11:02:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:02:57,746 INFO L93 Difference]: Finished difference Result 201 states and 282 transitions. [2024-10-24 11:02:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 11:02:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 76 [2024-10-24 11:02:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:02:57,751 INFO L225 Difference]: With dead ends: 201 [2024-10-24 11:02:57,751 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 11:02:57,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:02:57,753 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 147 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:02:57,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 200 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:02:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 11:02:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 82. [2024-10-24 11:02:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 11:02:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-10-24 11:02:57,795 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 76 [2024-10-24 11:02:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:02:57,796 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-10-24 11:02:57,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 11:02:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-10-24 11:02:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 11:02:57,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:02:57,809 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:02:57,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:02:58,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:58,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:02:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:02:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 772443923, now seen corresponding path program 1 times [2024-10-24 11:02:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:02:58,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656290483] [2024-10-24 11:02:58,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:02:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:02:58,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:02:58,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:02:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:02:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:02:58,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:02:58,134 INFO L278 TraceCheckSpWp]: Computing forward predicates...