./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:19:53,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:19:53,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:19:53,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:19:53,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:19:53,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:19:53,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:19:53,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:19:53,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:19:53,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:19:53,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:19:53,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:19:53,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:19:53,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:19:53,580 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:19:53,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:19:53,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:19:53,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:19:53,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:19:53,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:19:53,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:19:53,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:19:53,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:19:53,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:19:53,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:19:53,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:19:53,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:19:53,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:19:53,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:19:53,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:19:53,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:19:53,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:19:53,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:19:53,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:19:53,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:19:53,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:19:53,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:19:53,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:19:53,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:19:53,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:19:53,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:19:53,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:19:53,588 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2024-10-11 00:19:53,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:19:53,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:19:53,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:19:53,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:19:53,874 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:19:53,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-10-11 00:19:55,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:19:55,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:19:55,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-10-11 00:19:55,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1e3dd9b57/9bd475f4be424425a3cd2ac640324273/FLAG8b017e7cc [2024-10-11 00:19:55,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1e3dd9b57/9bd475f4be424425a3cd2ac640324273 [2024-10-11 00:19:55,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:19:55,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:19:55,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:19:55,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:19:55,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:19:55,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad0edeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55, skipping insertion in model container [2024-10-11 00:19:55,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:19:55,406 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/float-benchs/Muller_Kahan.c[631,644] [2024-10-11 00:19:55,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:19:55,431 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:19:55,443 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/float-benchs/Muller_Kahan.c[631,644] [2024-10-11 00:19:55,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:19:55,461 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:19:55,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55 WrapperNode [2024-10-11 00:19:55,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:19:55,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:19:55,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:19:55,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:19:55,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,490 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-10-11 00:19:55,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:19:55,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:19:55,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:19:55,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:19:55,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,512 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:19:55,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:19:55,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:19:55,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:19:55,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:19:55,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (1/1) ... [2024-10-11 00:19:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:19:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:19:55,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:19:55,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:19:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:19:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:19:55,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:19:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:19:55,655 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:19:55,657 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:19:55,735 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 00:19:55,735 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:19:55,753 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:19:55,754 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:19:55,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:55 BoogieIcfgContainer [2024-10-11 00:19:55,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:19:55,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:19:55,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:19:55,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:19:55,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:19:55" (1/3) ... [2024-10-11 00:19:55,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f73308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:55, skipping insertion in model container [2024-10-11 00:19:55,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:55" (2/3) ... [2024-10-11 00:19:55,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f73308d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:55, skipping insertion in model container [2024-10-11 00:19:55,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:55" (3/3) ... [2024-10-11 00:19:55,779 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2024-10-11 00:19:55,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:19:55,808 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:19:55,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:19:55,883 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;@de2499, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:19:55,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:19:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 00:19:55,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:19:55,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 00:19:55,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:19:55,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:19:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 59359658, now seen corresponding path program 1 times [2024-10-11 00:19:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:19:55,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218400821] [2024-10-11 00:19:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:55,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:19:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:19:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:19:56,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218400821] [2024-10-11 00:19:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218400821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:19:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:19:56,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:19:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926690535] [2024-10-11 00:19:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:19:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:19:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:19:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:19:56,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:19:56,134 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:19:56,157 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-11 00:19:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:19:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 00:19:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:19:56,165 INFO L225 Difference]: With dead ends: 15 [2024-10-11 00:19:56,165 INFO L226 Difference]: Without dead ends: 7 [2024-10-11 00:19:56,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 00:19:56,170 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:19:56,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:19:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-10-11 00:19:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-11 00:19:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-10-11 00:19:56,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-10-11 00:19:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:19:56,196 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-11 00:19:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-10-11 00:19:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 00:19:56,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:19:56,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 00:19:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:19:56,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:19:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:19:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1861149129, now seen corresponding path program 1 times [2024-10-11 00:19:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:19:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855905221] [2024-10-11 00:19:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:19:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:19:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:19:56,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855905221] [2024-10-11 00:19:56,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855905221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:19:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747582607] [2024-10-11 00:19:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:19:56,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:19:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 00:19:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:19:56,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:19:56,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:19:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:19:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747582607] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:19:56,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 00:19:56,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 00:19:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206409047] [2024-10-11 00:19:56,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 00:19:56,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:19:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:19:56,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:19:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:19:56,387 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:19:56,404 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-10-11 00:19:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 00:19:56,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 00:19:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:19:56,406 INFO L225 Difference]: With dead ends: 14 [2024-10-11 00:19:56,406 INFO L226 Difference]: Without dead ends: 10 [2024-10-11 00:19:56,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:19:56,407 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:19:56,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:19:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-11 00:19:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-11 00:19:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-10-11 00:19:56,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-10-11 00:19:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:19:56,411 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-10-11 00:19:56,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-10-11 00:19:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 00:19:56,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:19:56,412 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2024-10-11 00:19:56,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 00:19:56,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:56,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:19:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:19:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1138774378, now seen corresponding path program 2 times [2024-10-11 00:19:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:19:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682329254] [2024-10-11 00:19:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:19:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:19:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:19:56,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682329254] [2024-10-11 00:19:56,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682329254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:19:56,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997982829] [2024-10-11 00:19:56,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 00:19:56,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:56,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:19:56,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:19:56,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 00:19:56,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 00:19:56,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 00:19:56,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 00:19:56,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:19:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:19:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:56,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997982829] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:19:56,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 00:19:56,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 00:19:56,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722660469] [2024-10-11 00:19:56,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 00:19:56,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 00:19:56,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:19:56,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 00:19:56,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 00:19:56,878 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:19:56,901 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2024-10-11 00:19:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 00:19:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 00:19:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:19:56,903 INFO L225 Difference]: With dead ends: 20 [2024-10-11 00:19:56,903 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 00:19:56,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 00:19:56,905 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:19:56,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:19:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 00:19:56,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 00:19:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-10-11 00:19:56,909 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-10-11 00:19:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:19:56,910 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-10-11 00:19:56,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-10-11 00:19:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 00:19:56,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:19:56,911 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-11 00:19:56,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 00:19:57,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:57,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:19:57,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:19:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1689986314, now seen corresponding path program 3 times [2024-10-11 00:19:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:19:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296338548] [2024-10-11 00:19:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:57,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:19:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:19:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:57,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:19:57,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296338548] [2024-10-11 00:19:57,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296338548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:19:57,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196226573] [2024-10-11 00:19:57,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 00:19:57,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:57,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:19:57,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:19:57,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 00:19:57,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 00:19:57,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 00:19:57,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 00:19:57,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:19:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:57,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:19:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196226573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:19:57,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 00:19:57,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-10-11 00:19:57,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153526852] [2024-10-11 00:19:57,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 00:19:57,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 00:19:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:19:57,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 00:19:57,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-11 00:19:57,632 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:19:57,667 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-10-11 00:19:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 00:19:57,668 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 00:19:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:19:57,669 INFO L225 Difference]: With dead ends: 32 [2024-10-11 00:19:57,669 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 00:19:57,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-11 00:19:57,670 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:19:57,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:19:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 00:19:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 00:19:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-10-11 00:19:57,677 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2024-10-11 00:19:57,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:19:57,677 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-10-11 00:19:57,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-10-11 00:19:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 00:19:57,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:19:57,680 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1] [2024-10-11 00:19:57,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 00:19:57,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:57,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:19:57,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:19:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2031410102, now seen corresponding path program 4 times [2024-10-11 00:19:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:19:57,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79059764] [2024-10-11 00:19:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:19:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:19:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:19:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79059764] [2024-10-11 00:19:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79059764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:19:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621422824] [2024-10-11 00:19:58,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 00:19:58,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:19:58,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:19:58,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 00:19:58,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 00:19:58,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 00:19:58,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 00:19:58,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:19:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:58,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:19:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:19:59,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621422824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:19:59,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 00:19:59,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2024-10-11 00:19:59,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115477731] [2024-10-11 00:19:59,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 00:19:59,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-11 00:19:59,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:19:59,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-11 00:19:59,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 00:19:59,071 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 49 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:19:59,128 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2024-10-11 00:19:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-11 00:19:59,128 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-11 00:19:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:19:59,129 INFO L225 Difference]: With dead ends: 56 [2024-10-11 00:19:59,129 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 00:19:59,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 00:19:59,131 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:19:59,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:19:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 00:19:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 00:19:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2024-10-11 00:19:59,136 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 27 [2024-10-11 00:19:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:19:59,136 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2024-10-11 00:19:59,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:19:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2024-10-11 00:19:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 00:19:59,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:19:59,137 INFO L215 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1] [2024-10-11 00:19:59,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 00:19:59,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:19:59,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:19:59,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:19:59,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1825342154, now seen corresponding path program 5 times [2024-10-11 00:19:59,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:19:59,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738115961] [2024-10-11 00:19:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:19:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:19:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:20:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:20:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738115961] [2024-10-11 00:20:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738115961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:20:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187243937] [2024-10-11 00:20:00,394 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 00:20:00,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:20:00,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:20:00,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:20:00,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 00:20:00,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-10-11 00:20:00,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 00:20:00,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 00:20:00,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:20:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:00,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:20:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187243937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:20:02,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 00:20:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2024-10-11 00:20:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885609070] [2024-10-11 00:20:02,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 00:20:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-10-11 00:20:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:20:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-11 00:20:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-11 00:20:02,572 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 97 states, 97 states have (on average 1.041237113402062) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:20:02,668 INFO L93 Difference]: Finished difference Result 104 states and 151 transitions. [2024-10-11 00:20:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-11 00:20:02,669 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.041237113402062) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-11 00:20:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:20:02,670 INFO L225 Difference]: With dead ends: 104 [2024-10-11 00:20:02,670 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 00:20:02,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-11 00:20:02,673 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:20:02,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:20:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 00:20:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 00:20:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2024-10-11 00:20:02,681 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 51 [2024-10-11 00:20:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:20:02,682 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2024-10-11 00:20:02,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.041237113402062) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2024-10-11 00:20:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 00:20:02,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:20:02,684 INFO L215 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1] [2024-10-11 00:20:02,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 00:20:02,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:20:02,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:20:02,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:20:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389642, now seen corresponding path program 6 times [2024-10-11 00:20:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:20:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709841696] [2024-10-11 00:20:02,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:20:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:20:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:20:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:20:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709841696] [2024-10-11 00:20:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709841696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 00:20:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441463213] [2024-10-11 00:20:06,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 00:20:06,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 00:20:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:20:06,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 00:20:06,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 00:20:06,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2024-10-11 00:20:06,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 00:20:06,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-11 00:20:06,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:20:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:06,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:20:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441463213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:20:09,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 00:20:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 102 [2024-10-11 00:20:09,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958996009] [2024-10-11 00:20:09,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 00:20:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-10-11 00:20:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:20:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-10-11 00:20:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-10-11 00:20:09,538 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:20:09,650 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2024-10-11 00:20:09,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-11 00:20:09,653 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 00:20:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:20:09,655 INFO L225 Difference]: With dead ends: 110 [2024-10-11 00:20:09,655 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 00:20:09,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 101 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-10-11 00:20:09,657 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:20:09,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:20:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 00:20:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 00:20:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2024-10-11 00:20:09,665 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 99 [2024-10-11 00:20:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:20:09,665 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2024-10-11 00:20:09,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2024-10-11 00:20:09,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 00:20:09,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:20:09,666 INFO L215 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1] [2024-10-11 00:20:09,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 00:20:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-11 00:20:09,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:20:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:20:09,871 INFO L85 PathProgramCache]: Analyzing trace with hash -587510934, now seen corresponding path program 7 times [2024-10-11 00:20:09,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:20:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516272876] [2024-10-11 00:20:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:20:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:20:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:20:09,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:20:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:20:09,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:20:09,977 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:20:09,978 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:20:09,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 00:20:09,981 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1] [2024-10-11 00:20:10,044 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:20:10,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:20:10 BoogieIcfgContainer [2024-10-11 00:20:10,047 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:20:10,047 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:20:10,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:20:10,047 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:20:10,048 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:55" (3/4) ... [2024-10-11 00:20:10,049 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:20:10,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:20:10,051 INFO L158 Benchmark]: Toolchain (without parser) took 14787.01ms. Allocated memory was 182.5MB in the beginning and 333.4MB in the end (delta: 151.0MB). Free memory was 147.1MB in the beginning and 214.6MB in the end (delta: -67.6MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2024-10-11 00:20:10,051 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:20:10,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.79ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 134.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 00:20:10,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.20ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 133.6MB in the end (delta: 894.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:20:10,051 INFO L158 Benchmark]: Boogie Preprocessor took 36.88ms. Allocated memory is still 182.5MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:20:10,052 INFO L158 Benchmark]: RCFGBuilder took 224.82ms. Allocated memory is still 182.5MB. Free memory was 131.5MB in the beginning and 121.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 00:20:10,052 INFO L158 Benchmark]: TraceAbstraction took 14290.61ms. Allocated memory was 182.5MB in the beginning and 333.4MB in the end (delta: 151.0MB). Free memory was 119.8MB in the beginning and 214.6MB in the end (delta: -94.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2024-10-11 00:20:10,052 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 333.4MB. Free memory is still 214.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:20:10,053 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.13ms. Allocated memory is still 109.1MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.79ms. Allocated memory is still 182.5MB. Free memory was 146.2MB in the beginning and 134.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.20ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 133.6MB in the end (delta: 894.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.88ms. Allocated memory is still 182.5MB. Free memory was 133.6MB in the beginning and 131.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 224.82ms. Allocated memory is still 182.5MB. Free memory was 131.5MB in the beginning and 121.0MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14290.61ms. Allocated memory was 182.5MB in the beginning and 333.4MB in the end (delta: 151.0MB). Free memory was 119.8MB in the beginning and 214.6MB in the end (delta: -94.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 333.4MB. Free memory is still 214.6MB. 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: 12]: 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 someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=1] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=2] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=3] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=4] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=5] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=6] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=7] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=8] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=9] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=10] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=11] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=12] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=13] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=14] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=15] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=16] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=17] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=18] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=19] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=20] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=21] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=22] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=23] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=24] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=25] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=26] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=27] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=28] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=29] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=30] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=31] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=32] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=33] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=34] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=35] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=36] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=37] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=38] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=39] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=40] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=41] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=42] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=43] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=44] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=45] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=46] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=47] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=48] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=49] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=50] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=51] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=52] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=53] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=54] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=55] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=56] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=57] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=58] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=59] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=60] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=61] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=62] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=63] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=64] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=65] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=66] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=67] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=68] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=69] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=70] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=71] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=72] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=73] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=74] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=75] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=76] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=77] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=78] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=79] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=80] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=81] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=82] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=83] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=84] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=85] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=86] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=87] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=88] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=89] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=90] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=91] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=92] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=93] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=94] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=95] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=96] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=97] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=98] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=99] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=100] [L21] COND FALSE !(i < 100) [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 317 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 29 mSDtfsCounter, 317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 220 SyntacticMatches, 90 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 1707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/17595 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-11 00:20:10,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:20:12,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:20:12,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:20:12,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:20:12,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:20:12,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:20:12,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:20:12,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:20:12,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:20:12,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:20:12,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:20:12,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:20:12,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:20:12,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:20:12,083 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:20:12,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:20:12,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:20:12,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:20:12,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:20:12,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:20:12,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:20:12,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:20:12,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:20:12,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:20:12,090 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:20:12,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:20:12,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:20:12,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:20:12,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:20:12,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:20:12,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:20:12,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:20:12,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:20:12,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:20:12,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:20:12,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:20:12,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:20:12,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:20:12,092 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:20:12,092 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:20:12,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:20:12,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:20:12,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:20:12,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:20:12,093 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:20:12,093 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2024-10-11 00:20:12,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:20:12,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:20:12,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:20:12,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:20:12,382 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:20:12,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-10-11 00:20:13,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:20:13,848 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:20:13,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-10-11 00:20:13,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4048a17e7/028de1f4397a45498224a46afdf7e259/FLAGb6b2563ea [2024-10-11 00:20:13,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4048a17e7/028de1f4397a45498224a46afdf7e259 [2024-10-11 00:20:13,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:20:13,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:20:13,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:20:13,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:20:13,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:20:13,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:13" (1/1) ... [2024-10-11 00:20:13,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c72432a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:13, skipping insertion in model container [2024-10-11 00:20:13,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:20:13" (1/1) ... [2024-10-11 00:20:13,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:20:14,024 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/float-benchs/Muller_Kahan.c[631,644] [2024-10-11 00:20:14,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:20:14,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:20:14,062 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/float-benchs/Muller_Kahan.c[631,644] [2024-10-11 00:20:14,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:20:14,085 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:20:14,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14 WrapperNode [2024-10-11 00:20:14,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:20:14,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:20:14,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:20:14,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:20:14,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,116 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2024-10-11 00:20:14,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:20:14,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:20:14,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:20:14,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:20:14,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:20:14,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:20:14,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:20:14,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:20:14,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:20:14,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (1/1) ... [2024-10-11 00:20:14,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:20:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:20:14,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:20:14,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:20:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:20:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:20:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:20:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:20:14,312 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:20:14,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:20:19,059 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 00:20:19,060 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:20:19,084 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:20:19,084 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 00:20:19,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:19 BoogieIcfgContainer [2024-10-11 00:20:19,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:20:19,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:20:19,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:20:19,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:20:19,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:20:13" (1/3) ... [2024-10-11 00:20:19,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42acfe9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:19, skipping insertion in model container [2024-10-11 00:20:19,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:20:14" (2/3) ... [2024-10-11 00:20:19,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42acfe9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:20:19, skipping insertion in model container [2024-10-11 00:20:19,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:20:19" (3/3) ... [2024-10-11 00:20:19,091 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2024-10-11 00:20:19,104 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:20:19,105 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:20:19,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:20:19,167 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;@6996281b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:20:19,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:20:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 00:20:19,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:20:19,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 00:20:19,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:20:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:20:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 59359658, now seen corresponding path program 1 times [2024-10-11 00:20:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:20:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465404614] [2024-10-11 00:20:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:20:19,196 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-11 00:20:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:20:19,199 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 00:20:19,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 00:20:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:20:19,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 00:20:19,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:20:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:19,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:20:19,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:20:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465404614] [2024-10-11 00:20:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465404614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:20:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:20:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:20:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456243580] [2024-10-11 00:20:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:20:19,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:20:19,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:20:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:20:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:20:19,548 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:24,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:28,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:33,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:37,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:20:37,892 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-10-11 00:20:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:20:37,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 00:20:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:20:37,900 INFO L225 Difference]: With dead ends: 15 [2024-10-11 00:20:37,900 INFO L226 Difference]: Without dead ends: 7 [2024-10-11 00:20:37,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:20:37,904 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-10-11 00:20:37,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 4 Unknown, 0 Unchecked, 18.3s Time] [2024-10-11 00:20:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-10-11 00:20:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-11 00:20:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-10-11 00:20:37,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-10-11 00:20:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:20:37,932 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-11 00:20:37,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-10-11 00:20:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 00:20:37,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:20:37,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 00:20:37,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 00:20:38,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 00:20:38,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:20:38,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:20:38,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1861149129, now seen corresponding path program 1 times [2024-10-11 00:20:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:20:38,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753439177] [2024-10-11 00:20:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:20:38,140 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-11 00:20:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:20:38,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 00:20:38,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 00:20:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:20:39,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 00:20:39,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:20:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:40,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 00:20:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:20:40,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:20:40,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753439177] [2024-10-11 00:20:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753439177] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 00:20:40,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 00:20:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2024-10-11 00:20:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230125248] [2024-10-11 00:20:40,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 00:20:40,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 00:20:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:20:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 00:20:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 00:20:40,720 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:20:45,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:49,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:53,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:20:57,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:01,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:07,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:11,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:15,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:19,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:23,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:27,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:31,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 00:21:35,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []