./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-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-33.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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:46:05,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:46:05,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:46:05,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:46:05,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:46:05,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:46:05,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:46:05,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:46:05,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:46:05,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:46:05,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:46:05,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:46:05,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:46:05,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:46:05,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:46:05,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:46:05,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:46:05,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:46:05,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:46:05,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:46:05,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:46:05,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:46:05,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:46:05,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:46:05,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:46:05,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:46:05,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:46:05,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:46:05,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:46:05,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:46:05,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:46:05,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:46:05,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:05,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:46:05,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:46:05,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:46:05,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:46:05,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:46:05,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:46:05,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:46:05,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:46:05,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:46:05,404 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2024-10-13 05:46:05,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:46:05,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:46:05,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:46:05,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:46:05,711 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:46:05,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-10-13 05:46:07,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:46:07,485 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:46:07,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-10-13 05:46:07,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa375c72/c267ed0c1a974a77b0efb3740ac5e711/FLAGbb8143ca2 [2024-10-13 05:46:07,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fa375c72/c267ed0c1a974a77b0efb3740ac5e711 [2024-10-13 05:46:07,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:46:07,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:46:07,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:07,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:46:07,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:46:07,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:07" (1/1) ... [2024-10-13 05:46:07,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3485e129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:07, skipping insertion in model container [2024-10-13 05:46:07,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:07" (1/1) ... [2024-10-13 05:46:07,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:46:08,038 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-33.i[913,926] [2024-10-13 05:46:08,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:08,118 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:46:08,133 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-33.i[913,926] [2024-10-13 05:46:08,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:08,195 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:46:08,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08 WrapperNode [2024-10-13 05:46:08,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:08,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:08,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:46:08,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:46:08,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,252 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-13 05:46:08,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:08,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:46:08,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:46:08,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:46:08,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,304 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-13 05:46:08,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:46:08,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:46:08,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:46:08,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:46:08,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (1/1) ... [2024-10-13 05:46:08,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:08,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:08,376 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-13 05:46:08,380 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-13 05:46:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:46:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:46:08,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:46:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:46:08,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:46:08,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:46:08,562 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:46:08,566 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:46:08,891 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-13 05:46:08,891 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:46:08,922 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:46:08,923 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:46:08,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:08 BoogieIcfgContainer [2024-10-13 05:46:08,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:46:08,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:46:08,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:46:08,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:46:08,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:07" (1/3) ... [2024-10-13 05:46:08,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac62dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:08, skipping insertion in model container [2024-10-13 05:46:08,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:08" (2/3) ... [2024-10-13 05:46:08,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac62dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:08, skipping insertion in model container [2024-10-13 05:46:08,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:08" (3/3) ... [2024-10-13 05:46:08,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2024-10-13 05:46:08,954 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:46:08,954 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:46:09,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:46:09,038 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;@435377b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:46:09,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:46:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 05:46:09,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:09,056 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:09,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:09,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash 123147903, now seen corresponding path program 1 times [2024-10-13 05:46:09,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:09,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070623526] [2024-10-13 05:46:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070623526] [2024-10-13 05:46:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070623526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:09,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:46:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805681159] [2024-10-13 05:46:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:09,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:46:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:09,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:46:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:09,469 INFO L87 Difference]: Start difference. First operand has 60 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 05:46:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:09,515 INFO L93 Difference]: Finished difference Result 117 states and 189 transitions. [2024-10-13 05:46:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:46:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2024-10-13 05:46:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:09,530 INFO L225 Difference]: With dead ends: 117 [2024-10-13 05:46:09,530 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 05:46:09,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-13 05:46:09,540 INFO L432 NwaCegarLoop]: 83 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, 83 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-13 05:46:09,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 05:46:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 05:46:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:09,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-13 05:46:09,603 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 70 [2024-10-13 05:46:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:09,606 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-13 05:46:09,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 05:46:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-13 05:46:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 05:46:09,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:09,609 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:09,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:46:09,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -60785799, now seen corresponding path program 1 times [2024-10-13 05:46:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207393324] [2024-10-13 05:46:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207393324] [2024-10-13 05:46:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207393324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:46:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623763128] [2024-10-13 05:46:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:46:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:46:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:46:09,933 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:09,969 INFO L93 Difference]: Finished difference Result 116 states and 173 transitions. [2024-10-13 05:46:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:46:09,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 05:46:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:09,973 INFO L225 Difference]: With dead ends: 116 [2024-10-13 05:46:09,974 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 05:46:09,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-13 05:46:09,975 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:09,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 05:46:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 05:46:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-13 05:46:09,994 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 70 [2024-10-13 05:46:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:09,995 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-13 05:46:09,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-13 05:46:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 05:46:09,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:09,998 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:09,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:46:09,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:09,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash -870132425, now seen corresponding path program 1 times [2024-10-13 05:46:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:09,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524913037] [2024-10-13 05:46:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524913037] [2024-10-13 05:46:10,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524913037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:46:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984564752] [2024-10-13 05:46:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:10,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:46:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:46:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:46:10,230 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:10,477 INFO L93 Difference]: Finished difference Result 141 states and 207 transitions. [2024-10-13 05:46:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:46:10,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 05:46:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:10,480 INFO L225 Difference]: With dead ends: 141 [2024-10-13 05:46:10,480 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 05:46:10,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:46:10,486 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 83 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:10,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 248 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:46:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 05:46:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2024-10-13 05:46:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-10-13 05:46:10,503 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 70 [2024-10-13 05:46:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:10,504 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-10-13 05:46:10,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-10-13 05:46:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 05:46:10,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:10,507 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:10,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:46:10,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:10,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash -169067847, now seen corresponding path program 1 times [2024-10-13 05:46:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:10,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274705543] [2024-10-13 05:46:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274705543] [2024-10-13 05:46:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274705543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:46:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330478540] [2024-10-13 05:46:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:46:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:12,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:46:12,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:46:12,720 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:13,559 INFO L93 Difference]: Finished difference Result 243 states and 354 transitions. [2024-10-13 05:46:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:46:13,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 05:46:13,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:13,562 INFO L225 Difference]: With dead ends: 243 [2024-10-13 05:46:13,562 INFO L226 Difference]: Without dead ends: 183 [2024-10-13 05:46:13,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:46:13,564 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 226 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:13,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 350 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:46:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-13 05:46:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 79. [2024-10-13 05:46:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 68 states have internal predecessors, (97), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-13 05:46:13,583 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 70 [2024-10-13 05:46:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:13,585 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-13 05:46:13,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-13 05:46:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 05:46:13,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:13,589 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:13,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:46:13,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:13,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1757415749, now seen corresponding path program 1 times [2024-10-13 05:46:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:13,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87839706] [2024-10-13 05:46:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87839706] [2024-10-13 05:46:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87839706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:13,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:13,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:46:13,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774373842] [2024-10-13 05:46:13,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:46:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:46:13,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:46:13,997 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:14,267 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2024-10-13 05:46:14,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:46:14,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 70 [2024-10-13 05:46:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:14,269 INFO L225 Difference]: With dead ends: 226 [2024-10-13 05:46:14,269 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 05:46:14,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:46:14,270 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 208 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:14,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 325 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:46:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 05:46:14,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 87. [2024-10-13 05:46:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2024-10-13 05:46:14,290 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 70 [2024-10-13 05:46:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:14,291 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2024-10-13 05:46:14,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2024-10-13 05:46:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 05:46:14,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:14,294 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:14,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:46:14,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 513339644, now seen corresponding path program 1 times [2024-10-13 05:46:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103062911] [2024-10-13 05:46:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:14,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:14,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:14,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103062911] [2024-10-13 05:46:14,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103062911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:14,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:14,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:46:14,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691484354] [2024-10-13 05:46:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:14,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:46:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:46:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:46:14,374 INFO L87 Difference]: Start difference. First operand 87 states and 128 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:14,422 INFO L93 Difference]: Finished difference Result 226 states and 333 transitions. [2024-10-13 05:46:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:46:14,422 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-13 05:46:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:14,425 INFO L225 Difference]: With dead ends: 226 [2024-10-13 05:46:14,425 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 05:46:14,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-13 05:46:14,429 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:14,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 172 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 05:46:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2024-10-13 05:46:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-10-13 05:46:14,443 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 71 [2024-10-13 05:46:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:14,443 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-10-13 05:46:14,443 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-10-13 05:46:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 05:46:14,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:14,447 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:46:14,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:14,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2104015663, now seen corresponding path program 1 times [2024-10-13 05:46:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877390658] [2024-10-13 05:46:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:14,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877390658] [2024-10-13 05:46:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877390658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:46:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102452663] [2024-10-13 05:46:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:14,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:46:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:46:14,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:46:14,520 INFO L87 Difference]: Start difference. First operand 107 states and 155 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:14,563 INFO L93 Difference]: Finished difference Result 246 states and 355 transitions. [2024-10-13 05:46:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:46:14,564 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-13 05:46:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:14,565 INFO L225 Difference]: With dead ends: 246 [2024-10-13 05:46:14,565 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 05:46:14,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-13 05:46:14,567 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:14,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:14,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 05:46:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 90. [2024-10-13 05:46:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-13 05:46:14,573 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 71 [2024-10-13 05:46:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:14,573 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-13 05:46:14,573 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-13 05:46:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-13 05:46:14,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:14,575 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:14,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:46:14,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:14,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1531250867, now seen corresponding path program 1 times [2024-10-13 05:46:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:14,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506711787] [2024-10-13 05:46:14,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506711787] [2024-10-13 05:46:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506711787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:15,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:15,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:46:15,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603158635] [2024-10-13 05:46:15,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:15,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:46:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:15,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:46:15,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:46:15,388 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:16,206 INFO L93 Difference]: Finished difference Result 334 states and 472 transitions. [2024-10-13 05:46:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:46:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 71 [2024-10-13 05:46:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:16,208 INFO L225 Difference]: With dead ends: 334 [2024-10-13 05:46:16,208 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 05:46:16,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:46:16,210 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 249 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:16,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 410 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:46:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 05:46:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 74. [2024-10-13 05:46:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-10-13 05:46:16,220 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 71 [2024-10-13 05:46:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-10-13 05:46:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-10-13 05:46:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:46:16,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:16,223 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:46:16,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:16,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2035515578, now seen corresponding path program 1 times [2024-10-13 05:46:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839632419] [2024-10-13 05:46:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:16,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:16,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839632419] [2024-10-13 05:46:16,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839632419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:16,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:16,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:46:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142295832] [2024-10-13 05:46:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:16,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:46:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:46:16,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:46:16,343 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:16,563 INFO L93 Difference]: Finished difference Result 232 states and 324 transitions. [2024-10-13 05:46:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:46:16,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-13 05:46:16,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:16,565 INFO L225 Difference]: With dead ends: 232 [2024-10-13 05:46:16,565 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 05:46:16,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:46:16,566 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 195 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:16,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 285 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:46:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 05:46:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 153. [2024-10-13 05:46:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.3515625) internal successors, (173), 130 states have internal predecessors, (173), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:46:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-10-13 05:46:16,589 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 72 [2024-10-13 05:46:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:16,589 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-10-13 05:46:16,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-10-13 05:46:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:46:16,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:16,591 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:46:16,592 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:16,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1777350140, now seen corresponding path program 1 times [2024-10-13 05:46:16,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:16,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327877696] [2024-10-13 05:46:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:17,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327877696] [2024-10-13 05:46:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327877696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:17,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:46:17,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296514230] [2024-10-13 05:46:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:17,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:46:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:46:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:46:17,632 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:18,328 INFO L93 Difference]: Finished difference Result 452 states and 630 transitions. [2024-10-13 05:46:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:46:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-13 05:46:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:18,332 INFO L225 Difference]: With dead ends: 452 [2024-10-13 05:46:18,332 INFO L226 Difference]: Without dead ends: 303 [2024-10-13 05:46:18,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-13 05:46:18,333 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 369 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:18,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 177 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:46:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-13 05:46:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 173. [2024-10-13 05:46:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.364864864864865) internal successors, (202), 150 states have internal predecessors, (202), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:46:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 242 transitions. [2024-10-13 05:46:18,350 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 242 transitions. Word has length 72 [2024-10-13 05:46:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:18,351 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 242 transitions. [2024-10-13 05:46:18,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 242 transitions. [2024-10-13 05:46:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:46:18,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:18,354 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:46:18,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:18,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash 828673414, now seen corresponding path program 1 times [2024-10-13 05:46:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642158743] [2024-10-13 05:46:18,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:18,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642158743] [2024-10-13 05:46:18,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642158743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:18,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:18,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:46:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051598156] [2024-10-13 05:46:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:46:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:18,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:46:18,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:46:18,475 INFO L87 Difference]: Start difference. First operand 173 states and 242 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:18,556 INFO L93 Difference]: Finished difference Result 489 states and 683 transitions. [2024-10-13 05:46:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:46:18,558 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 72 [2024-10-13 05:46:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:18,560 INFO L225 Difference]: With dead ends: 489 [2024-10-13 05:46:18,560 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 05:46:18,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-13 05:46:18,563 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 60 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:18,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 163 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:46:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 05:46:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 251. [2024-10-13 05:46:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 217 states have internal predecessors, (290), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 05:46:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 348 transitions. [2024-10-13 05:46:18,584 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 348 transitions. Word has length 72 [2024-10-13 05:46:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:18,585 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 348 transitions. [2024-10-13 05:46:18,585 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 348 transitions. [2024-10-13 05:46:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 05:46:18,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:18,586 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:46:18,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:18,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 881496481, now seen corresponding path program 1 times [2024-10-13 05:46:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:18,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889878534] [2024-10-13 05:46:18,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:18,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:46:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:46:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:46:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:46:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 05:46:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889878534] [2024-10-13 05:46:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889878534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:46:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937446731] [2024-10-13 05:46:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:46:18,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:18,734 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-13 05:46:18,736 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-13 05:46:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:18,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:46:18,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:46:19,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:46:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 05:46:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937446731] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:46:19,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:46:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-10-13 05:46:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325019821] [2024-10-13 05:46:19,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:46:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 05:46:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:19,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 05:46:19,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:46:19,257 INFO L87 Difference]: Start difference. First operand 251 states and 348 transitions. Second operand has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 05:46:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:19,841 INFO L93 Difference]: Finished difference Result 839 states and 1130 transitions. [2024-10-13 05:46:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 05:46:19,842 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 73 [2024-10-13 05:46:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:19,846 INFO L225 Difference]: With dead ends: 839 [2024-10-13 05:46:19,846 INFO L226 Difference]: Without dead ends: 737 [2024-10-13 05:46:19,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=877, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 05:46:19,848 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1086 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:19,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 556 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:46:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-13 05:46:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 267. [2024-10-13 05:46:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 209 states have (on average 1.277511961722488) internal successors, (267), 210 states have internal predecessors, (267), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 05:46:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 357 transitions. [2024-10-13 05:46:19,890 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 357 transitions. Word has length 73 [2024-10-13 05:46:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:19,891 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 357 transitions. [2024-10-13 05:46:19,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 05:46:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 357 transitions. [2024-10-13 05:46:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 05:46:19,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:19,892 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:19,912 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-13 05:46:20,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 05:46:20,094 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:20,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 63848031, now seen corresponding path program 1 times [2024-10-13 05:46:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652913975] [2024-10-13 05:46:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:20,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:46:20,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:46:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:46:20,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:46:20,182 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:46:20,183 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:46:20,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:46:20,188 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:46:20,263 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:46:20,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:46:20 BoogieIcfgContainer [2024-10-13 05:46:20,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:46:20,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:46:20,268 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:46:20,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:46:20,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:08" (3/4) ... [2024-10-13 05:46:20,271 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:46:20,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:46:20,272 INFO L158 Benchmark]: Toolchain (without parser) took 12421.73ms. Allocated memory was 142.6MB in the beginning and 289.4MB in the end (delta: 146.8MB). Free memory was 71.1MB in the beginning and 208.7MB in the end (delta: -137.5MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,273 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:46:20,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.59ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 56.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.64ms. Allocated memory is still 142.6MB. Free memory was 56.8MB in the beginning and 53.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,274 INFO L158 Benchmark]: Boogie Preprocessor took 87.63ms. Allocated memory is still 142.6MB. Free memory was 53.7MB in the beginning and 50.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,274 INFO L158 Benchmark]: RCFGBuilder took 581.60ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 50.2MB in the beginning and 149.6MB in the end (delta: -99.5MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,275 INFO L158 Benchmark]: TraceAbstraction took 11340.77ms. Allocated memory was 197.1MB in the beginning and 289.4MB in the end (delta: 92.3MB). Free memory was 149.6MB in the beginning and 209.7MB in the end (delta: -60.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,275 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 289.4MB. Free memory was 209.7MB in the beginning and 208.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:46:20,278 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.16ms. Allocated memory is still 142.6MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.59ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 56.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.64ms. Allocated memory is still 142.6MB. Free memory was 56.8MB in the beginning and 53.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.63ms. Allocated memory is still 142.6MB. Free memory was 53.7MB in the beginning and 50.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 581.60ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 50.2MB in the beginning and 149.6MB in the end (delta: -99.5MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11340.77ms. Allocated memory was 197.1MB in the beginning and 289.4MB in the end (delta: 92.3MB). Free memory was 149.6MB in the beginning and 209.7MB in the end (delta: -60.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 289.4MB. Free memory was 209.7MB in the beginning and 208.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-10, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=16388, var_1_13=0, var_1_14=0, var_1_15=16388, var_1_16=200, var_1_1=-272, var_1_5=16383, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2607 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2599 mSDsluCounter, 3069 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2081 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2248 IncrementalHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 988 mSDtfsCounter, 2248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=12, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 998 NumberOfCodeBlocks, 998 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 5697 SizeOfPredicates, 4 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 1944/2016 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-13 05:46:20,311 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-33.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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:46:22,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:46:22,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:46:22,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:46:22,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:46:22,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:46:22,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:46:22,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:46:22,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:46:22,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:46:22,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:46:22,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:46:22,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:46:22,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:46:22,683 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:46:22,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:46:22,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:46:22,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:46:22,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:46:22,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:46:22,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:46:22,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:46:22,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:46:22,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:46:22,690 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:46:22,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:46:22,690 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:46:22,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:46:22,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:46:22,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:46:22,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:46:22,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:46:22,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:46:22,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:46:22,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:22,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:46:22,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:46:22,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:46:22,693 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:46:22,693 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:46:22,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:46:22,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:46:22,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:46:22,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:46:22,695 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:46:22,695 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2024-10-13 05:46:23,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:46:23,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:46:23,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:46:23,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:46:23,079 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:46:23,081 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-10-13 05:46:24,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:46:24,865 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:46:24,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-10-13 05:46:24,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ed2446f/48bdcbcecc024aefb1206abaf9e79a2a/FLAG5339b6bd1 [2024-10-13 05:46:24,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10ed2446f/48bdcbcecc024aefb1206abaf9e79a2a [2024-10-13 05:46:24,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:46:24,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:46:24,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:24,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:46:24,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:46:24,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:24" (1/1) ... [2024-10-13 05:46:24,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d8a4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:24, skipping insertion in model container [2024-10-13 05:46:24,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:24" (1/1) ... [2024-10-13 05:46:24,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:46:25,103 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-33.i[913,926] [2024-10-13 05:46:25,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:25,178 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:46:25,190 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-33.i[913,926] [2024-10-13 05:46:25,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:25,238 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:46:25,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25 WrapperNode [2024-10-13 05:46:25,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:25,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:25,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:46:25,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:46:25,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,292 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-13 05:46:25,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:25,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:46:25,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:46:25,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:46:25,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,321 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-13 05:46:25,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:46:25,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:46:25,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:46:25,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:46:25,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (1/1) ... [2024-10-13 05:46:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:25,390 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-13 05:46:25,397 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-13 05:46:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:46:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:46:25,437 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:46:25,437 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:46:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:46:25,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:46:25,526 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:46:25,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:46:26,169 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:46:26,169 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:46:26,226 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:46:26,226 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:46:26,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:26 BoogieIcfgContainer [2024-10-13 05:46:26,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:46:26,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:46:26,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:46:26,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:46:26,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:24" (1/3) ... [2024-10-13 05:46:26,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c61cfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:26, skipping insertion in model container [2024-10-13 05:46:26,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:25" (2/3) ... [2024-10-13 05:46:26,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c61cfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:26, skipping insertion in model container [2024-10-13 05:46:26,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:26" (3/3) ... [2024-10-13 05:46:26,235 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2024-10-13 05:46:26,250 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:46:26,251 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:46:26,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:46:26,324 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;@6c88695b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:46:26,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:46:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 05:46:26,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:26,338 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:26,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1056546956, now seen corresponding path program 1 times [2024-10-13 05:46:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382024975] [2024-10-13 05:46:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:26,361 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-13 05:46:26,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:26,365 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-13 05:46:26,366 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-13 05:46:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:26,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:46:26,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-13 05:46:26,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:46:26,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:46:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382024975] [2024-10-13 05:46:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382024975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:46:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833022009] [2024-10-13 05:46:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:26,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:46:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:46:26,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:46:26,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:26,692 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 05:46:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:27,005 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2024-10-13 05:46:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:46:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-10-13 05:46:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:27,025 INFO L225 Difference]: With dead ends: 67 [2024-10-13 05:46:27,026 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 05:46:27,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 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-13 05:46:27,034 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:27,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:46:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 05:46:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 05:46:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-13 05:46:27,078 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 62 [2024-10-13 05:46:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:27,079 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-13 05:46:27,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 05:46:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-13 05:46:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 05:46:27,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:27,084 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:27,093 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-13 05:46:27,287 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-13 05:46:27,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:27,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 924409454, now seen corresponding path program 1 times [2024-10-13 05:46:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:27,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564396628] [2024-10-13 05:46:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:27,292 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-13 05:46:27,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:27,296 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-13 05:46:27,297 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-13 05:46:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:27,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:46:27,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:46:28,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:46:28,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:46:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564396628] [2024-10-13 05:46:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564396628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:46:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [826677942] [2024-10-13 05:46:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:28,202 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:46:28,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:46:28,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:46:28,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 05:46:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:28,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:46:28,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 05:46:28,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:46:28,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [826677942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:46:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-13 05:46:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193397108] [2024-10-13 05:46:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:46:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:46:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:46:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:46:28,710 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:29,159 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-13 05:46:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:46:29,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2024-10-13 05:46:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:29,162 INFO L225 Difference]: With dead ends: 89 [2024-10-13 05:46:29,162 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 05:46:29,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:46:29,163 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:29,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 189 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:46:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 05:46:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2024-10-13 05:46:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 05:46:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-13 05:46:29,178 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 62 [2024-10-13 05:46:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-13 05:46:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 05:46:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-13 05:46:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 05:46:29,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:29,185 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:29,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-13 05:46:29,392 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 05:46:29,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-13 05:46:29,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash 926316078, now seen corresponding path program 1 times [2024-10-13 05:46:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657670643] [2024-10-13 05:46:29,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:29,588 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-13 05:46:29,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:29,593 INFO L229 MonitoredProcess]: Starting monitored process 5 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-13 05:46:29,595 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 (5)] Waiting until timeout for monitored process [2024-10-13 05:46:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:29,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:46:29,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:46:30,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:46:30,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:46:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657670643] [2024-10-13 05:46:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657670643] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:46:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1822489681] [2024-10-13 05:46:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:30,195 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:46:30,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:46:30,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:46:30,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 05:46:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:30,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 05:46:30,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:46:31,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:46:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1822489681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:46:31,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:46:31,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-13 05:46:31,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396807663] [2024-10-13 05:46:31,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:46:31,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:46:31,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:46:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:46:31,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:46:31,124 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 05:46:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:32,167 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2024-10-13 05:46:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 05:46:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2024-10-13 05:46:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:32,177 INFO L225 Difference]: With dead ends: 104 [2024-10-13 05:46:32,177 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 05:46:32,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:46:32,179 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 42 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:32,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:46:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 05:46:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2024-10-13 05:46:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 05:46:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-10-13 05:46:32,194 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 62 [2024-10-13 05:46:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:32,194 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-10-13 05:46:32,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 05:46:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-10-13 05:46:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 05:46:32,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:32,196 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:46:32,205 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 05:46:32,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-13 05:46:32,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 05:46:32,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1606374448, now seen corresponding path program 1 times [2024-10-13 05:46:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11504698] [2024-10-13 05:46:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:32,601 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-13 05:46:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:32,604 INFO L229 MonitoredProcess]: Starting monitored process 7 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-13 05:46:32,605 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 (7)] Waiting until timeout for monitored process [2024-10-13 05:46:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:32,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 05:46:32,770 INFO L278 TraceCheckSpWp]: Computing forward predicates...