./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_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 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:58:17,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:58:17,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:58:17,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:58:17,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:58:17,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:58:17,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:58:17,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:58:17,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:58:17,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:58:17,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:58:17,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:58:17,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:58:17,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:58:17,328 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:58:17,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:58:17,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:58:17,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:58:17,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:58:17,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:58:17,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:58:17,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:58:17,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:58:17,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:58:17,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:58:17,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:58:17,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:58:17,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:58:17,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:58:17,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:58:17,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:58:17,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:58:17,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:58:17,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:58:17,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:58:17,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:58:17,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:58:17,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:58:17,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:58:17,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:58:17,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:58:17,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:58:17,339 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 -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-11-08 22:58:17,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:58:17,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:58:17,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:58:17,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:58:17,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:58:17,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-08 22:58:19,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:58:19,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:58:19,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-08 22:58:19,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8888b828/6576491998ce45e7b024e77581ef1448/FLAG594d5841b [2024-11-08 22:58:19,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8888b828/6576491998ce45e7b024e77581ef1448 [2024-11-08 22:58:19,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:58:19,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:58:19,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:19,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:58:19,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:58:19,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1272ced0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19, skipping insertion in model container [2024-11-08 22:58:19,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:58:19,492 WARN L250 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-08 22:58:19,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:19,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:58:19,581 WARN L250 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-08 22:58:19,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:19,633 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:58:19,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19 WrapperNode [2024-11-08 22:58:19,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:19,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:19,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:58:19,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:58:19,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,694 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-11-08 22:58:19,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:19,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:58:19,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:58:19,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:58:19,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,737 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-11-08 22:58:19,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:58:19,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:58:19,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:58:19,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:58:19,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (1/1) ... [2024-11-08 22:58:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:58:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:58:19,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:58:19,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:58:19,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:58:19,862 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:58:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:58:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:58:19,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:58:19,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:58:19,946 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:58:19,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:58:20,292 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 22:58:20,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:58:20,305 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:58:20,305 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:58:20,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:20 BoogieIcfgContainer [2024-11-08 22:58:20,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:58:20,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:58:20,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:58:20,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:58:20,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:58:19" (1/3) ... [2024-11-08 22:58:20,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28da5cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:58:20, skipping insertion in model container [2024-11-08 22:58:20,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:19" (2/3) ... [2024-11-08 22:58:20,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28da5cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:58:20, skipping insertion in model container [2024-11-08 22:58:20,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:20" (3/3) ... [2024-11-08 22:58:20,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-08 22:58:20,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:58:20,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:58:20,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:58:20,395 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;@2232925c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:58:20,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:58:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 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-11-08 22:58:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 22:58:20,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:20,413 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, 1] [2024-11-08 22:58:20,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash 123038288, now seen corresponding path program 1 times [2024-11-08 22:58:20,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:20,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036025270] [2024-11-08 22:58:20,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:20,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036025270] [2024-11-08 22:58:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036025270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:58:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244230788] [2024-11-08 22:58:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:20,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:58:20,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:58:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:58:20,747 INFO L87 Difference]: Start difference. First operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-11-08 22:58:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:20,768 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2024-11-08 22:58:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:58:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 74 [2024-11-08 22:58:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:20,777 INFO L225 Difference]: With dead ends: 125 [2024-11-08 22:58:20,778 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 22:58:20,780 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-11-08 22:58:20,783 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:20,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:58:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 22:58:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 22:58:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 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-11-08 22:58:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-08 22:58:20,821 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 74 [2024-11-08 22:58:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:20,822 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-08 22:58:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-11-08 22:58:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-08 22:58:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 22:58:20,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:20,825 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, 1] [2024-11-08 22:58:20,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:58:20,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:20,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1283939178, now seen corresponding path program 1 times [2024-11-08 22:58:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:20,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506318503] [2024-11-08 22:58:20,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:20,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:21,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:21,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506318503] [2024-11-08 22:58:21,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506318503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:21,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:58:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499309159] [2024-11-08 22:58:21,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:58:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:21,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:58:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:58:21,163 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-08 22:58:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:21,193 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2024-11-08 22:58:21,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:58:21,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 74 [2024-11-08 22:58:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:21,195 INFO L225 Difference]: With dead ends: 122 [2024-11-08 22:58:21,195 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 22:58:21,196 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-11-08 22:58:21,200 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:21,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:58:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 22:58:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-08 22:58:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 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-11-08 22:58:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-11-08 22:58:21,213 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 74 [2024-11-08 22:58:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:21,216 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-11-08 22:58:21,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-11-08 22:58:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-08 22:58:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 22:58:21,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:21,220 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, 1] [2024-11-08 22:58:21,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:58:21,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:21,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash -603880808, now seen corresponding path program 1 times [2024-11-08 22:58:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158021653] [2024-11-08 22:58:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:21,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:21,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158021653] [2024-11-08 22:58:21,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158021653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:21,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:21,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:58:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189143667] [2024-11-08 22:58:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:58:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:58:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:58:21,424 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-11-08 22:58:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:21,649 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2024-11-08 22:58:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:58:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 74 [2024-11-08 22:58:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:21,651 INFO L225 Difference]: With dead ends: 148 [2024-11-08 22:58:21,651 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 22:58:21,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:58:21,653 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:21,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:58:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 22:58:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2024-11-08 22:58:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 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-11-08 22:58:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-08 22:58:21,672 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 74 [2024-11-08 22:58:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:21,673 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-08 22:58:21,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-11-08 22:58:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-08 22:58:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 22:58:21,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:21,677 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, 1] [2024-11-08 22:58:21,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:58:21,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash -345715370, now seen corresponding path program 1 times [2024-11-08 22:58:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806207640] [2024-11-08 22:58:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806207640] [2024-11-08 22:58:23,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806207640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:23,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:23,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 22:58:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609070231] [2024-11-08 22:58:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:23,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:58:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:58:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:58:23,854 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-11-08 22:58:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:24,510 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2024-11-08 22:58:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 22:58:24,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 74 [2024-11-08 22:58:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:24,513 INFO L225 Difference]: With dead ends: 268 [2024-11-08 22:58:24,513 INFO L226 Difference]: Without dead ends: 206 [2024-11-08 22:58:24,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-08 22:58:24,515 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 363 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:24,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 280 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:58:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-08 22:58:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 89. [2024-11-08 22:58:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 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-11-08 22:58:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-08 22:58:24,529 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 74 [2024-11-08 22:58:24,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:24,530 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-08 22:58:24,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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-11-08 22:58:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-08 22:58:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 22:58:24,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:24,531 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, 1] [2024-11-08 22:58:24,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:58:24,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1955107220, now seen corresponding path program 1 times [2024-11-08 22:58:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696510858] [2024-11-08 22:58:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:24,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:24,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:25,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:25,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696510858] [2024-11-08 22:58:25,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696510858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:25,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:25,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 22:58:25,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639720000] [2024-11-08 22:58:25,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:25,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:58:25,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:25,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:58:25,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:58:25,013 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-11-08 22:58:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:25,336 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2024-11-08 22:58:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 22:58:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 74 [2024-11-08 22:58:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:25,339 INFO L225 Difference]: With dead ends: 207 [2024-11-08 22:58:25,340 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 22:58:25,341 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-11-08 22:58:25,342 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:25,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 204 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:58:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 22:58:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2024-11-08 22:58:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 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-11-08 22:58:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-11-08 22:58:25,355 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 74 [2024-11-08 22:58:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:25,356 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-11-08 22:58:25,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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-11-08 22:58:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-11-08 22:58:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:58:25,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:25,360 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, 1, 1] [2024-11-08 22:58:25,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:58:25,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 212492637, now seen corresponding path program 1 times [2024-11-08 22:58:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:25,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85962454] [2024-11-08 22:58:25,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:25,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:25,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:25,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85962454] [2024-11-08 22:58:25,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85962454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:25,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:25,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:58:25,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586234011] [2024-11-08 22:58:25,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:25,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:58:25,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:25,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:58:25,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:58:25,446 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-08 22:58:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:25,501 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-08 22:58:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:58:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 75 [2024-11-08 22:58:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:25,504 INFO L225 Difference]: With dead ends: 196 [2024-11-08 22:58:25,504 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 22:58:25,506 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-11-08 22:58:25,507 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:25,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:58:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 22:58:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-11-08 22:58:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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-11-08 22:58:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-08 22:58:25,526 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 75 [2024-11-08 22:58:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-08 22:58:25,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-08 22:58:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-08 22:58:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 22:58:25,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:25,528 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, 1, 1] [2024-11-08 22:58:25,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:58:25,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:25,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2016158326, now seen corresponding path program 1 times [2024-11-08 22:58:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849022070] [2024-11-08 22:58:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849022070] [2024-11-08 22:58:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849022070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:25,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:25,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:58:25,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469790691] [2024-11-08 22:58:25,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:25,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:58:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:58:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:58:25,588 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-08 22:58:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:25,628 INFO L93 Difference]: Finished difference Result 207 states and 295 transitions. [2024-11-08 22:58:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:58:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 75 [2024-11-08 22:58:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:25,630 INFO L225 Difference]: With dead ends: 207 [2024-11-08 22:58:25,630 INFO L226 Difference]: Without dead ends: 120 [2024-11-08 22:58:25,631 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-11-08 22:58:25,631 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:25,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 143 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:58:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-08 22:58:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2024-11-08 22:58:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-11-08 22:58:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-11-08 22:58:25,642 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 75 [2024-11-08 22:58:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:25,642 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-11-08 22:58:25,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-08 22:58:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-11-08 22:58:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 22:58:25,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:25,645 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, 1, 1, 1] [2024-11-08 22:58:25,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:58:25,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash -31631447, now seen corresponding path program 1 times [2024-11-08 22:58:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:25,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670407979] [2024-11-08 22:58:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:25,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:25,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670407979] [2024-11-08 22:58:25,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670407979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:25,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:25,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:58:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158148600] [2024-11-08 22:58:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:25,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:58:25,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:58:25,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:58:25,757 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-11-08 22:58:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:25,991 INFO L93 Difference]: Finished difference Result 241 states and 333 transitions. [2024-11-08 22:58:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 22:58:25,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 76 [2024-11-08 22:58:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:25,993 INFO L225 Difference]: With dead ends: 241 [2024-11-08 22:58:25,993 INFO L226 Difference]: Without dead ends: 166 [2024-11-08 22:58:25,993 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-11-08 22:58:25,994 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:25,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:58:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-08 22:58:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-11-08 22:58:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 137 states have internal predecessors, (180), 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-11-08 22:58:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-11-08 22:58:26,018 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 76 [2024-11-08 22:58:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:26,018 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-11-08 22:58:26,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-11-08 22:58:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-11-08 22:58:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 22:58:26,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:26,020 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, 1, 1, 1] [2024-11-08 22:58:26,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:58:26,021 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:26,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash -618437461, now seen corresponding path program 1 times [2024-11-08 22:58:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:26,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505125070] [2024-11-08 22:58:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505125070] [2024-11-08 22:58:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505125070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:27,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:27,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 22:58:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736752065] [2024-11-08 22:58:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:27,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:58:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:58:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:58:27,044 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-11-08 22:58:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:27,834 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2024-11-08 22:58:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 22:58:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 76 [2024-11-08 22:58:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:27,838 INFO L225 Difference]: With dead ends: 467 [2024-11-08 22:58:27,838 INFO L226 Difference]: Without dead ends: 314 [2024-11-08 22:58:27,839 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-11-08 22:58:27,840 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 265 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:27,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 331 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 22:58:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-08 22:58:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2024-11-08 22:58:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 157 states have internal predecessors, (209), 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-11-08 22:58:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2024-11-08 22:58:27,857 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 76 [2024-11-08 22:58:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:27,858 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2024-11-08 22:58:27,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-11-08 22:58:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2024-11-08 22:58:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 22:58:27,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:27,859 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, 1, 1, 1] [2024-11-08 22:58:27,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 22:58:27,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:27,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1436085911, now seen corresponding path program 1 times [2024-11-08 22:58:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:27,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528457790] [2024-11-08 22:58:27,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:27,964 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:27,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528457790] [2024-11-08 22:58:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528457790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:27,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:58:27,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817903145] [2024-11-08 22:58:27,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:27,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:58:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:58:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:58:27,967 INFO L87 Difference]: Start difference. First operand 180 states and 249 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-08 22:58:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:28,048 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2024-11-08 22:58:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:58:28,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 76 [2024-11-08 22:58:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:28,051 INFO L225 Difference]: With dead ends: 504 [2024-11-08 22:58:28,052 INFO L226 Difference]: Without dead ends: 331 [2024-11-08 22:58:28,052 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-11-08 22:58:28,053 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:28,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:58:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-08 22:58:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2024-11-08 22:58:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.3348214285714286) internal successors, (299), 226 states have internal predecessors, (299), 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-11-08 22:58:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2024-11-08 22:58:28,077 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 76 [2024-11-08 22:58:28,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:28,078 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2024-11-08 22:58:28,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-08 22:58:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2024-11-08 22:58:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 22:58:28,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:28,079 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, 1, 1, 1, 1] [2024-11-08 22:58:28,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 22:58:28,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:28,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:28,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1752940520, now seen corresponding path program 1 times [2024-11-08 22:58:28,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485350335] [2024-11-08 22:58:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:28,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:58:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:58:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:58:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:58:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:58:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 22:58:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 22:58:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 22:58:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 22:58:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 22:58:28,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:58:28,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485350335] [2024-11-08 22:58:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485350335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:58:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040479378] [2024-11-08 22:58:28,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:58:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:58:28,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:58:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:58:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:28,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 22:58:28,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:58:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 22:58:28,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:58:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 22:58:28,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040479378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:58:28,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:58:28,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-11-08 22:58:28,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244922726] [2024-11-08 22:58:28,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:58:28,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 22:58:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:58:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 22:58:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:58:28,795 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-08 22:58:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:29,407 INFO L93 Difference]: Finished difference Result 872 states and 1163 transitions. [2024-11-08 22:58:29,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 22:58:29,407 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 77 [2024-11-08 22:58:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:29,411 INFO L225 Difference]: With dead ends: 872 [2024-11-08 22:58:29,411 INFO L226 Difference]: Without dead ends: 768 [2024-11-08 22:58:29,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 22:58:29,413 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1031 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:29,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 712 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:58:29,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-08 22:58:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 278. [2024-11-08 22:58:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 221 states have internal predecessors, (278), 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-11-08 22:58:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 368 transitions. [2024-11-08 22:58:29,451 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 368 transitions. Word has length 77 [2024-11-08 22:58:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:29,451 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 368 transitions. [2024-11-08 22:58:29,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-08 22:58:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 368 transitions. [2024-11-08 22:58:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 22:58:29,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:29,452 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, 1, 1, 1, 1] [2024-11-08 22:58:29,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:58:29,656 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,SelfDestructingSolverStorable10 [2024-11-08 22:58:29,657 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:29,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:29,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1330238694, now seen corresponding path program 1 times [2024-11-08 22:58:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:58:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142479682] [2024-11-08 22:58:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:58:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:58:29,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:58:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:58:29,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:58:29,736 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:58:29,737 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:58:29,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 22:58:29,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:58:29,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:58:29,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:58:29 BoogieIcfgContainer [2024-11-08 22:58:29,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:58:29,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:58:29,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:58:29,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:58:29,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:20" (3/4) ... [2024-11-08 22:58:29,809 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:58:29,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:58:29,811 INFO L158 Benchmark]: Toolchain (without parser) took 10544.00ms. Allocated memory was 180.4MB in the beginning and 352.3MB in the end (delta: 172.0MB). Free memory was 129.3MB in the beginning and 162.1MB in the end (delta: -32.8MB). Peak memory consumption was 140.9MB. Max. memory is 16.1GB. [2024-11-08 22:58:29,811 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 180.4MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:58:29,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.88ms. Allocated memory is still 180.4MB. Free memory was 129.3MB in the beginning and 115.3MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 22:58:29,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.60ms. Allocated memory is still 180.4MB. Free memory was 115.3MB in the beginning and 111.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:58:29,812 INFO L158 Benchmark]: Boogie Preprocessor took 69.82ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 108.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:58:29,813 INFO L158 Benchmark]: RCFGBuilder took 540.00ms. Allocated memory is still 180.4MB. Free memory was 108.3MB in the beginning and 86.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 22:58:29,813 INFO L158 Benchmark]: TraceAbstraction took 9497.85ms. Allocated memory was 180.4MB in the beginning and 352.3MB in the end (delta: 172.0MB). Free memory was 86.0MB in the beginning and 162.1MB in the end (delta: -76.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-11-08 22:58:29,813 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 352.3MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:58:29,814 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.19ms. Allocated memory is still 180.4MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.88ms. Allocated memory is still 180.4MB. Free memory was 129.3MB in the beginning and 115.3MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.60ms. Allocated memory is still 180.4MB. Free memory was 115.3MB in the beginning and 111.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.82ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 108.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 540.00ms. Allocated memory is still 180.4MB. Free memory was 108.3MB in the beginning and 86.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9497.85ms. Allocated memory was 180.4MB in the beginning and 352.3MB in the end (delta: 172.0MB). Free memory was 86.0MB in the beginning and 162.1MB in the end (delta: -76.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 352.3MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 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; VAL [isInitial=0, 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=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 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=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, 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=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2275 mSDsluCounter, 2878 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 932 mSDtfsCounter, 1835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 78, 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, 11 MinimizatonAttempts, 959 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 4575 SizeOfPredicates, 4 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1800/1872 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-11-08 22:58:29,847 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_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 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:58:32,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:58:32,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:58:32,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:58:32,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:58:32,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:58:32,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:58:32,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:58:32,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:58:32,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:58:32,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:58:32,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:58:32,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:58:32,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:58:32,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:58:32,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:58:32,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:58:32,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:58:32,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:58:32,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:58:32,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:58:32,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:58:32,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:58:32,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:58:32,289 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:58:32,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:58:32,289 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:58:32,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:58:32,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:58:32,290 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:58:32,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:58:32,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:58:32,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:58:32,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:58:32,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:58:32,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:58:32,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:58:32,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:58:32,292 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:58:32,292 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:58:32,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:58:32,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:58:32,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:58:32,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:58:32,294 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 -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-11-08 22:58:32,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:58:32,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:58:32,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:58:32,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:58:32,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:58:32,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-08 22:58:34,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:58:34,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:58:34,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-08 22:58:34,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d59261ef/2dcb3f1eccd242c5a00f1a33a3aba459/FLAGd97785821 [2024-11-08 22:58:34,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d59261ef/2dcb3f1eccd242c5a00f1a33a3aba459 [2024-11-08 22:58:34,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:58:34,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:58:34,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:34,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:58:34,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:58:34,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fce033a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34, skipping insertion in model container [2024-11-08 22:58:34,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:58:34,737 WARN L250 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-08 22:58:34,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:34,813 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:58:34,824 WARN L250 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_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-08 22:58:34,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:58:34,878 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:58:34,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34 WrapperNode [2024-11-08 22:58:34,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:58:34,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:34,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:58:34,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:58:34,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,933 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-08 22:58:34,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:58:34,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:58:34,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:58:34,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:58:34,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,962 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-11-08 22:58:34,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:34,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:58:34,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:58:35,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:58:35,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:58:35,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (1/1) ... [2024-11-08 22:58:35,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:58:35,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:58:35,040 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:58:35,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:58:35,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:58:35,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:58:35,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:58:35,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:58:35,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:58:35,952 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:58:35,956 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:58:35,967 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:58:35,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:58:35,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:35 BoogieIcfgContainer [2024-11-08 22:58:35,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:58:35,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:58:35,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:58:35,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:58:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:58:34" (1/3) ... [2024-11-08 22:58:35,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aedce47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:58:35, skipping insertion in model container [2024-11-08 22:58:35,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:58:34" (2/3) ... [2024-11-08 22:58:35,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aedce47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:58:35, skipping insertion in model container [2024-11-08 22:58:35,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:58:35" (3/3) ... [2024-11-08 22:58:35,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-08 22:58:35,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:58:35,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:58:36,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:58:36,073 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;@66f22852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:58:36,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:58:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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-11-08 22:58:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 22:58:36,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:36,086 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] [2024-11-08 22:58:36,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:36,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:36,095 INFO L85 PathProgramCache]: Analyzing trace with hash -222403520, now seen corresponding path program 1 times [2024-11-08 22:58:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:58:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481813114] [2024-11-08 22:58:36,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:36,112 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-11-08 22:58:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:58:36,115 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-11-08 22:58:36,116 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-11-08 22:58:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:36,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:58:36,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:58:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-08 22:58:36,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:58:36,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:58:36,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481813114] [2024-11-08 22:58:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481813114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:36,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:58:36,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:58:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828288116] [2024-11-08 22:58:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:36,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:58:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:58:36,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:58:36,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:58:36,424 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 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), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 22:58:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:36,450 INFO L93 Difference]: Finished difference Result 75 states and 117 transitions. [2024-11-08 22:58:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:58:36,452 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), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-11-08 22:58:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:36,457 INFO L225 Difference]: With dead ends: 75 [2024-11-08 22:58:36,457 INFO L226 Difference]: Without dead ends: 37 [2024-11-08 22:58:36,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:58:36,464 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:36,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:58:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-08 22:58:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-08 22:58:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-11-08 22:58:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-08 22:58:36,505 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-08 22:58:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:36,505 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-08 22:58:36,506 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), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 22:58:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-08 22:58:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 22:58:36,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:36,510 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] [2024-11-08 22:58:36,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:58:36,710 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-11-08 22:58:36,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:36,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1057703046, now seen corresponding path program 1 times [2024-11-08 22:58:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:58:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098544436] [2024-11-08 22:58:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:36,713 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-11-08 22:58:36,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:58:36,715 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-11-08 22:58:36,717 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-11-08 22:58:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:36,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:58:36,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:58:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 22:58:37,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:58:37,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:58:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098544436] [2024-11-08 22:58:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098544436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:58:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1777271000] [2024-11-08 22:58:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:37,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:58:37,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:58:37,755 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-11-08 22:58:37,756 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-11-08 22:58:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:38,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:58:38,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:58:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-08 22:58:38,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:58:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1777271000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:58:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:58:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-08 22:58:38,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115348243] [2024-11-08 22:58:38,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:58:38,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:58:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:58:38,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:58:38,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 22:58:38,279 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-08 22:58:38,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:38,778 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2024-11-08 22:58:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:58:38,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 66 [2024-11-08 22:58:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:38,781 INFO L225 Difference]: With dead ends: 96 [2024-11-08 22:58:38,781 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 22:58:38,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 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-11-08 22:58:38,784 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:38,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 210 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:58:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 22:58:38,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2024-11-08 22:58:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-11-08 22:58:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-08 22:58:38,800 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 66 [2024-11-08 22:58:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:38,803 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-08 22:58:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-11-08 22:58:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-08 22:58:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 22:58:38,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:38,807 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] [2024-11-08 22:58:38,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-08 22:58:39,014 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-11-08 22:58:39,207 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-11-08 22:58:39,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:39,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1116808390, now seen corresponding path program 1 times [2024-11-08 22:58:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:58:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497157017] [2024-11-08 22:58:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:39,210 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-11-08 22:58:39,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:58:39,213 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-11-08 22:58:39,215 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-11-08 22:58:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:39,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:58:39,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:58:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 22:58:39,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:58:39,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:58:39,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497157017] [2024-11-08 22:58:39,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497157017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:58:39,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1126444766] [2024-11-08 22:58:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:39,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:58:39,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:58:39,870 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-11-08 22:58:39,871 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-11-08 22:58:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:40,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:58:40,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:58:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 22:58:40,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:58:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1126444766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:58:40,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:58:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-08 22:58:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981275592] [2024-11-08 22:58:40,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:58:40,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:58:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:58:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:58:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:58:40,639 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-11-08 22:58:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:58:41,371 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2024-11-08 22:58:41,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:58:41,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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 66 [2024-11-08 22:58:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:58:41,379 INFO L225 Difference]: With dead ends: 112 [2024-11-08 22:58:41,379 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 22:58:41,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 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-11-08 22:58:41,381 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 22:58:41,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 22:58:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 22:58:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2024-11-08 22:58:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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-11-08 22:58:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-08 22:58:41,399 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 66 [2024-11-08 22:58:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:58:41,399 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-08 22:58:41,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 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-11-08 22:58:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-08 22:58:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 22:58:41,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:58:41,401 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] [2024-11-08 22:58:41,410 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-11-08 22:58:41,610 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-11-08 22:58:41,804 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-11-08 22:58:41,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:58:41,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:58:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 723781380, now seen corresponding path program 1 times [2024-11-08 22:58:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:58:41,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922394250] [2024-11-08 22:58:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:58:41,806 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-11-08 22:58:41,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:58:41,809 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-11-08 22:58:41,811 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-11-08 22:58:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:58:41,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 22:58:41,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:59:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 22:59:31,312 INFO L311 TraceCheckSpWp]: Computing backward predicates...