./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.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 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:27:56,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:27:56,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:27:56,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:27:56,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:27:56,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:27:56,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:27:56,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:27:56,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:27:56,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:27:56,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:27:56,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:27:56,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:27:56,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:27:56,499 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:27:56,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:27:56,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:27:56,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:27:56,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:27:56,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:27:56,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:27:56,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:27:56,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:27:56,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:27:56,506 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:27:56,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:27:56,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:27:56,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:27:56,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:27:56,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:27:56,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:27:56,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:27:56,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:27:56,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:27:56,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:27:56,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:27:56,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:27:56,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:27:56,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:27:56,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:27:56,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:27:56,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:27:56,513 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 -> 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 [2024-10-13 03:27:56,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:27:56,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:27:56,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:27:56,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:27:56,777 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:27:56,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2024-10-13 03:27:58,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:27:58,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:27:58,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2024-10-13 03:27:58,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27cee4a89/1561aceab3f34056a63d65aa31c2807b/FLAG233ae443c [2024-10-13 03:27:58,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27cee4a89/1561aceab3f34056a63d65aa31c2807b [2024-10-13 03:27:58,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:27:58,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:27:58,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:27:58,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:27:58,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:27:58,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:27:58" (1/1) ... [2024-10-13 03:27:58,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b27c615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:58, skipping insertion in model container [2024-10-13 03:27:58,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:27:58" (1/1) ... [2024-10-13 03:27:59,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:27:59,154 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2024-10-13 03:27:59,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:27:59,199 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:27:59,210 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2024-10-13 03:27:59,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:27:59,243 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:27:59,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59 WrapperNode [2024-10-13 03:27:59,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:27:59,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:27:59,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:27:59,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:27:59,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,336 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-13 03:27:59,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:27:59,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:27:59,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:27:59,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:27:59,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,386 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:27:59,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:27:59,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:27:59,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:27:59,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:27:59,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (1/1) ... [2024-10-13 03:27:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:27:59,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:27:59,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:27:59,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:27:59,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:27:59,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:27:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:27:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:27:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:27:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:27:59,616 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:27:59,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:27:59,948 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 03:27:59,949 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:27:59,986 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:27:59,987 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:27:59,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:27:59 BoogieIcfgContainer [2024-10-13 03:27:59,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:27:59,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:27:59,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:27:59,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:27:59,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:27:58" (1/3) ... [2024-10-13 03:28:00,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9030b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:00, skipping insertion in model container [2024-10-13 03:28:00,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:27:59" (2/3) ... [2024-10-13 03:28:00,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9030b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:00, skipping insertion in model container [2024-10-13 03:28:00,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:27:59" (3/3) ... [2024-10-13 03:28:00,002 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-55.i [2024-10-13 03:28:00,038 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:28:00,039 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:28:00,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:28:00,152 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;@1b1f1449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:28:00,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:28:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 03:28:00,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:00,166 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:00,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1981177798, now seen corresponding path program 1 times [2024-10-13 03:28:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:00,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281685482] [2024-10-13 03:28:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:00,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:00,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:00,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281685482] [2024-10-13 03:28:00,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281685482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:28:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485503350] [2024-10-13 03:28:00,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:00,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:28:00,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:28:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:28:00,498 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 03:28:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:00,527 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2024-10-13 03:28:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:28:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-10-13 03:28:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:00,539 INFO L225 Difference]: With dead ends: 109 [2024-10-13 03:28:00,539 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 03:28:00,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:28:00,546 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:00,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:28:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 03:28:00,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 03:28:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-10-13 03:28:00,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 82 [2024-10-13 03:28:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:00,583 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-10-13 03:28:00,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 03:28:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-10-13 03:28:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 03:28:00,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:00,587 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:00,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:28:00,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:00,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1547244098, now seen corresponding path program 1 times [2024-10-13 03:28:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363064815] [2024-10-13 03:28:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363064815] [2024-10-13 03:28:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363064815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:28:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838457948] [2024-10-13 03:28:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:00,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:28:00,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:00,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:28:00,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:00,825 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:00,860 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2024-10-13 03:28:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:28:00,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-13 03:28:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:00,863 INFO L225 Difference]: With dead ends: 133 [2024-10-13 03:28:00,863 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 03:28:00,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:00,864 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:00,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 142 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:28:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 03:28:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2024-10-13 03:28:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-10-13 03:28:00,872 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 82 [2024-10-13 03:28:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:00,874 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-10-13 03:28:00,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-10-13 03:28:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 03:28:00,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:00,875 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:28:00,875 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -846179520, now seen corresponding path program 1 times [2024-10-13 03:28:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774163815] [2024-10-13 03:28:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:01,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:01,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774163815] [2024-10-13 03:28:01,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774163815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:01,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:28:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367431142] [2024-10-13 03:28:01,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:01,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:28:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:28:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:01,017 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:01,050 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2024-10-13 03:28:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:28:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-13 03:28:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:01,052 INFO L225 Difference]: With dead ends: 109 [2024-10-13 03:28:01,052 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 03:28:01,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:01,053 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:01,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:28:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 03:28:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 03:28:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-10-13 03:28:01,059 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 82 [2024-10-13 03:28:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:01,060 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-10-13 03:28:01,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-10-13 03:28:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 03:28:01,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:01,061 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:01,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:28:01,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:01,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash -312165467, now seen corresponding path program 1 times [2024-10-13 03:28:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799780203] [2024-10-13 03:28:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:01,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799780203] [2024-10-13 03:28:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799780203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:28:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252237394] [2024-10-13 03:28:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:01,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:28:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:28:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:28:01,492 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:01,625 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2024-10-13 03:28:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:28:01,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-13 03:28:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:01,627 INFO L225 Difference]: With dead ends: 135 [2024-10-13 03:28:01,627 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 03:28:01,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:28:01,629 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:01,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 223 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:28:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 03:28:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2024-10-13 03:28:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-10-13 03:28:01,639 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 84 [2024-10-13 03:28:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:01,639 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-10-13 03:28:01,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-10-13 03:28:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 03:28:01,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:01,641 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:28:01,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:01,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1416162689, now seen corresponding path program 1 times [2024-10-13 03:28:01,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934743115] [2024-10-13 03:28:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934743115] [2024-10-13 03:28:01,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934743115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:01,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:28:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349753491] [2024-10-13 03:28:01,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:01,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:28:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:01,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:28:01,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:01,911 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:01,980 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2024-10-13 03:28:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:28:01,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 03:28:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:01,986 INFO L225 Difference]: With dead ends: 186 [2024-10-13 03:28:01,987 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 03:28:01,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:01,989 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:01,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:28:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 03:28:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2024-10-13 03:28:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 03:28:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-13 03:28:02,004 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 85 [2024-10-13 03:28:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:02,004 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-13 03:28:02,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-13 03:28:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 03:28:02,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:02,006 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:02,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:28:02,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:02,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:02,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1131812814, now seen corresponding path program 1 times [2024-10-13 03:28:02,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:02,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852090844] [2024-10-13 03:28:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:02,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:02,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:02,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852090844] [2024-10-13 03:28:02,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852090844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:02,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:02,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:28:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37670032] [2024-10-13 03:28:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:02,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:28:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:28:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:28:02,156 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:02,293 INFO L93 Difference]: Finished difference Result 342 states and 473 transitions. [2024-10-13 03:28:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:28:02,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-10-13 03:28:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:02,296 INFO L225 Difference]: With dead ends: 342 [2024-10-13 03:28:02,296 INFO L226 Difference]: Without dead ends: 276 [2024-10-13 03:28:02,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:28:02,298 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 142 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:02,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 287 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:28:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-13 03:28:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 231. [2024-10-13 03:28:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 03:28:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2024-10-13 03:28:02,333 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 86 [2024-10-13 03:28:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:02,333 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2024-10-13 03:28:02,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2024-10-13 03:28:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 03:28:02,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:02,335 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:02,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:28:02,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:02,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:02,336 INFO L85 PathProgramCache]: Analyzing trace with hash 120695564, now seen corresponding path program 1 times [2024-10-13 03:28:02,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:02,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131947932] [2024-10-13 03:28:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:02,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:02,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131947932] [2024-10-13 03:28:02,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131947932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:02,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:02,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:28:02,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820990972] [2024-10-13 03:28:02,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:02,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:28:02,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:02,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:28:02,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:28:02,782 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:03,063 INFO L93 Difference]: Finished difference Result 504 states and 697 transitions. [2024-10-13 03:28:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:28:03,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-10-13 03:28:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:03,067 INFO L225 Difference]: With dead ends: 504 [2024-10-13 03:28:03,067 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 03:28:03,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:28:03,072 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:03,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 271 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:28:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 03:28:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 282. [2024-10-13 03:28:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 216 states have internal predecessors, (274), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 03:28:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 394 transitions. [2024-10-13 03:28:03,123 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 394 transitions. Word has length 86 [2024-10-13 03:28:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:03,123 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 394 transitions. [2024-10-13 03:28:03,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 394 transitions. [2024-10-13 03:28:03,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 03:28:03,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:03,125 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:03,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:28:03,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:03,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:03,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1051844427, now seen corresponding path program 1 times [2024-10-13 03:28:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:03,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537375496] [2024-10-13 03:28:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 03:28:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 03:28:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 03:28:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 03:28:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 03:28:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 03:28:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 03:28:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537375496] [2024-10-13 03:28:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537375496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:03,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:28:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962596248] [2024-10-13 03:28:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:03,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:28:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:28:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:03,210 INFO L87 Difference]: Start difference. First operand 282 states and 394 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:03,295 INFO L93 Difference]: Finished difference Result 512 states and 716 transitions. [2024-10-13 03:28:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:28:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-10-13 03:28:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:03,298 INFO L225 Difference]: With dead ends: 512 [2024-10-13 03:28:03,298 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 03:28:03,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:03,303 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:03,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:28:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 03:28:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-10-13 03:28:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 216 states have (on average 1.2407407407407407) internal successors, (268), 216 states have internal predecessors, (268), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 03:28:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 388 transitions. [2024-10-13 03:28:03,371 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 388 transitions. Word has length 87 [2024-10-13 03:28:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:03,371 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 388 transitions. [2024-10-13 03:28:03,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 388 transitions. [2024-10-13 03:28:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 03:28:03,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:03,373 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:03,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:28:03,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:03,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1964995131, now seen corresponding path program 1 times [2024-10-13 03:28:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:03,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359647112] [2024-10-13 03:28:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:28:03,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:28:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:28:03,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:28:03,470 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:28:03,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:28:03,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:28:03,475 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:03,547 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:28:03,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:28:03 BoogieIcfgContainer [2024-10-13 03:28:03,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:28:03,552 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:28:03,552 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:28:03,552 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:28:03,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:27:59" (3/4) ... [2024-10-13 03:28:03,554 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:28:03,555 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:28:03,556 INFO L158 Benchmark]: Toolchain (without parser) took 4573.92ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 83.8MB in the beginning and 242.4MB in the end (delta: -158.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:28:03,556 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 105.3MB in the end (delta: 98.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:28:03,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.20ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 69.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:28:03,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.57ms. Allocated memory is still 155.2MB. Free memory was 69.4MB in the beginning and 66.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:28:03,557 INFO L158 Benchmark]: Boogie Preprocessor took 73.21ms. Allocated memory is still 155.2MB. Free memory was 66.6MB in the beginning and 63.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:28:03,557 INFO L158 Benchmark]: RCFGBuilder took 579.86ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 63.2MB in the beginning and 196.0MB in the end (delta: -132.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-13 03:28:03,557 INFO L158 Benchmark]: TraceAbstraction took 3558.75ms. Allocated memory was 239.1MB in the beginning and 299.9MB in the end (delta: 60.8MB). Free memory was 195.2MB in the beginning and 242.4MB in the end (delta: -47.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:28:03,558 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 299.9MB. Free memory is still 242.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:28:03,559 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.15ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 105.3MB in the end (delta: 98.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.20ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 69.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.57ms. Allocated memory is still 155.2MB. Free memory was 69.4MB in the beginning and 66.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.21ms. Allocated memory is still 155.2MB. Free memory was 66.6MB in the beginning and 63.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 579.86ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 63.2MB in the beginning and 196.0MB in the end (delta: -132.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3558.75ms. Allocated memory was 239.1MB in the beginning and 299.9MB in the end (delta: 60.8MB). Free memory was 195.2MB in the beginning and 242.4MB in the end (delta: -47.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 299.9MB. Free memory is still 242.4MB. 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 97, overapproximation of shiftRight at line 60, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] double var_1_7 = 256.75; [L26] double var_1_8 = 63.5; [L27] double var_1_9 = 1.8; [L28] double var_1_10 = 0.25; [L29] double var_1_11 = 16.5; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] float var_1_15 = 4.6; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] last_1_var_1_12 = var_1_12 [L94] last_1_var_1_17 = var_1_17 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && 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_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && 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_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L86] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L87] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L87] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L88] var_1_18 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L89] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L90] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L90] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L105] RET updateVariables() [L106] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L44] COND FALSE !(stepLocal_1 && var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L54] COND TRUE \read(var_1_2) [L55] var_1_7 = (((var_1_8 + var_1_9) + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-256, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L62] COND FALSE !((~ var_1_17) <= stepLocal_3) [L67] var_1_12 = (var_1_17 - var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L97-L98] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((float) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 1399 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 780 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 619 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=7, InterpolantAutomatonStates: 31, 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, 8 MinimizatonAttempts, 179 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2112/2112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:28:03,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.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 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:28:05,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:28:05,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:28:05,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:28:05,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:28:05,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:28:05,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:28:05,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:28:05,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:28:05,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:28:05,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:28:05,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:28:05,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:28:05,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:28:05,931 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:28:05,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:28:05,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:28:05,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:28:05,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:28:05,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:28:05,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:28:05,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:28:05,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:28:05,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:28:05,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:28:05,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:28:05,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:28:05,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:28:05,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:28:05,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:28:05,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:28:05,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:28:05,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:28:05,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:28:05,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:28:05,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:28:05,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:28:05,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:28:05,941 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:28:05,942 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:28:05,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:28:05,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:28:05,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:28:05,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:28:05,943 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:28:05,944 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 -> 7e6ed1d14258049906061abbce24342c9de4fd69e39d97fedb90d68f7dbc6816 [2024-10-13 03:28:06,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:28:06,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:28:06,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:28:06,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:28:06,552 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:28:06,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2024-10-13 03:28:08,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:28:08,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:28:08,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i [2024-10-13 03:28:08,333 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ba359d9/05a3ed20e51e4d72a2451a11bb4d4304/FLAGaca5c03d5 [2024-10-13 03:28:08,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ba359d9/05a3ed20e51e4d72a2451a11bb4d4304 [2024-10-13 03:28:08,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:28:08,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:28:08,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:28:08,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:28:08,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:28:08,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:08,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e467cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08, skipping insertion in model container [2024-10-13 03:28:08,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:08,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:28:08,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2024-10-13 03:28:08,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:28:08,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:28:08,944 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-55.i[917,930] [2024-10-13 03:28:08,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:28:08,978 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:28:08,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08 WrapperNode [2024-10-13 03:28:08,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:28:08,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:28:08,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:28:08,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:28:08,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,053 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 03:28:09,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:28:09,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:28:09,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:28:09,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:28:09,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:28:09,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:28:09,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:28:09,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:28:09,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:28:09,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (1/1) ... [2024-10-13 03:28:09,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:28:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:28:09,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:28:09,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:28:09,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:28:09,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:28:09,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:28:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:28:09,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:28:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:28:09,306 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:28:09,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:28:13,870 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:28:13,870 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:28:13,908 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:28:13,909 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:28:13,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:13 BoogieIcfgContainer [2024-10-13 03:28:13,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:28:13,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:28:13,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:28:13,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:28:13,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:28:08" (1/3) ... [2024-10-13 03:28:13,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb1919f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:13, skipping insertion in model container [2024-10-13 03:28:13,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:08" (2/3) ... [2024-10-13 03:28:13,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb1919f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:13, skipping insertion in model container [2024-10-13 03:28:13,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:13" (3/3) ... [2024-10-13 03:28:13,918 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-55.i [2024-10-13 03:28:13,934 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:28:13,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:28:13,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:28:14,010 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;@4df3ca83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:28:14,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:28:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 03:28:14,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:14,024 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:14,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:14,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1113787404, now seen corresponding path program 1 times [2024-10-13 03:28:14,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:28:14,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602414572] [2024-10-13 03:28:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:14,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:14,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:28:14,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:28:14,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:28:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:14,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:28:14,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:28:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 03:28:14,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:28:14,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:28:14,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602414572] [2024-10-13 03:28:14,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602414572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:14,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:14,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:28:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132976304] [2024-10-13 03:28:14,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:28:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:28:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:28:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:28:14,569 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 03:28:16,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:28:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:16,577 INFO L93 Difference]: Finished difference Result 77 states and 130 transitions. [2024-10-13 03:28:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:28:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-13 03:28:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:16,616 INFO L225 Difference]: With dead ends: 77 [2024-10-13 03:28:16,616 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 03:28:16,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:28:16,624 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:16,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 03:28:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 03:28:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 03:28:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2024-10-13 03:28:16,668 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 77 [2024-10-13 03:28:16,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:16,668 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2024-10-13 03:28:16,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 03:28:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2024-10-13 03:28:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 03:28:16,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:16,672 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:16,684 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-10-13 03:28:16,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:16,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 866099988, now seen corresponding path program 1 times [2024-10-13 03:28:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:28:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779490677] [2024-10-13 03:28:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:16,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:16,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:28:16,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:28:16,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:28:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:17,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:28:17,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:28:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 03:28:17,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:28:17,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:28:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779490677] [2024-10-13 03:28:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779490677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:28:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929958242] [2024-10-13 03:28:17,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:17,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:28:17,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:28:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:28:17,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:17,225 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:19,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:28:22,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:28:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:22,580 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2024-10-13 03:28:22,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:28:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-13 03:28:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:22,615 INFO L225 Difference]: With dead ends: 85 [2024-10-13 03:28:22,615 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 03:28:22,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:28:22,617 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:22,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-13 03:28:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 03:28:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2024-10-13 03:28:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 03:28:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2024-10-13 03:28:22,627 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 77 [2024-10-13 03:28:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:22,629 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2024-10-13 03:28:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 03:28:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2024-10-13 03:28:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 03:28:22,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:22,632 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:28:22,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:28:22,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:22,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:22,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash 923358290, now seen corresponding path program 1 times [2024-10-13 03:28:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:28:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508341724] [2024-10-13 03:28:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:22,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:22,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:28:22,841 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:28:22,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:28:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:23,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 03:28:23,155 INFO L278 TraceCheckSpWp]: Computing forward predicates...