./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i --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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i -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 de05dd5e3bf0aa71208c9225f4fdf36a7def96a9278aed9da8f88e67d49713ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:00:54,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:00:54,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:00:54,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:00:54,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:00:54,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:00:54,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:00:54,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:00:54,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:00:54,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:00:54,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:00:54,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:00:54,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:00:54,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:00:54,417 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:00:54,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:00:54,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:00:54,418 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:00:54,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:00:54,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:00:54,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:00:54,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:00:54,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:00:54,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:00:54,420 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:00:54,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:00:54,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:00:54,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:00:54,421 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:00:54,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:00:54,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:00:54,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:00:54,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:00:54,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:00:54,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:00:54,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:00:54,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:00:54,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:00:54,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:00:54,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:00:54,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:00:54,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:00:54,425 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 -> de05dd5e3bf0aa71208c9225f4fdf36a7def96a9278aed9da8f88e67d49713ff [2024-10-11 11:00:54,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:00:54,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:00:54,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:00:54,704 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:00:54,704 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:00:54,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i [2024-10-11 11:00:56,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:00:56,361 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:00:56,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i [2024-10-11 11:00:56,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/081f584d0/688a875209fc4e05a44a956c6b126586/FLAGbb89b0333 [2024-10-11 11:00:56,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/081f584d0/688a875209fc4e05a44a956c6b126586 [2024-10-11 11:00:56,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:00:56,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:00:56,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:00:56,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:00:56,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:00:56,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb206f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56, skipping insertion in model container [2024-10-11 11:00:56,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:00:56,604 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i[915,928] [2024-10-11 11:00:56,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:00:56,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:00:56,659 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i[915,928] [2024-10-11 11:00:56,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:00:56,689 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:00:56,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56 WrapperNode [2024-10-11 11:00:56,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:00:56,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:00:56,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:00:56,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:00:56,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,735 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-11 11:00:56,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:00:56,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:00:56,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:00:56,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:00:56,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,770 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 11:00:56,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:00:56,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:00:56,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:00:56,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:00:56,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (1/1) ... [2024-10-11 11:00:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:00:56,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:00:56,868 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 11:00:56,873 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 11:00:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:00:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:00:56,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:00:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:00:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:00:56,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:00:56,994 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:00:56,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:00:57,232 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 11:00:57,232 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:00:57,277 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:00:57,277 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:00:57,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:57 BoogieIcfgContainer [2024-10-11 11:00:57,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:00:57,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:00:57,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:00:57,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:00:57,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:00:56" (1/3) ... [2024-10-11 11:00:57,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503312df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:00:57, skipping insertion in model container [2024-10-11 11:00:57,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:00:56" (2/3) ... [2024-10-11 11:00:57,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503312df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:00:57, skipping insertion in model container [2024-10-11 11:00:57,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:57" (3/3) ... [2024-10-11 11:00:57,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-9.i [2024-10-11 11:00:57,298 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:00:57,298 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:00:57,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:00:57,363 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;@184683d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:00:57,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:00:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:00:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 11:00:57,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:57,379 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:00:57,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:57,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1077877456, now seen corresponding path program 1 times [2024-10-11 11:00:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:57,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506898497] [2024-10-11 11:00:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:57,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:00:57,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:57,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506898497] [2024-10-11 11:00:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506898497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:57,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:00:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907180382] [2024-10-11 11:00:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:57,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:00:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:00:57,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:00:57,696 INFO L87 Difference]: Start difference. First operand has 36 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:00:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:57,739 INFO L93 Difference]: Finished difference Result 68 states and 106 transitions. [2024-10-11 11:00:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:00:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2024-10-11 11:00:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:57,750 INFO L225 Difference]: With dead ends: 68 [2024-10-11 11:00:57,750 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 11:00:57,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:00:57,756 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:57,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 11:00:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 11:00:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:00:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-11 11:00:57,801 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 46 [2024-10-11 11:00:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:57,802 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-11 11:00:57,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:00:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-11 11:00:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 11:00:57,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:57,806 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:00:57,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:00:57,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:57,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1504072080, now seen corresponding path program 1 times [2024-10-11 11:00:57,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:57,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906530798] [2024-10-11 11:00:57,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:00:58,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:58,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906530798] [2024-10-11 11:00:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906530798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:58,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:00:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081539668] [2024-10-11 11:00:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:00:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:00:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:00:58,395 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:00:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:58,560 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2024-10-11 11:00:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:00:58,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-10-11 11:00:58,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:58,563 INFO L225 Difference]: With dead ends: 97 [2024-10-11 11:00:58,563 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 11:00:58,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:00:58,565 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:58,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 121 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:00:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 11:00:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2024-10-11 11:00:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:00:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2024-10-11 11:00:58,584 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 46 [2024-10-11 11:00:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:58,585 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2024-10-11 11:00:58,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:00:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2024-10-11 11:00:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 11:00:58,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:58,588 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:00:58,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:00:58,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:58,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1931801048, now seen corresponding path program 1 times [2024-10-11 11:00:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374740960] [2024-10-11 11:00:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:00:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374740960] [2024-10-11 11:00:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374740960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:00:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985651576] [2024-10-11 11:00:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:00:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:00:58,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:00:58,879 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:00:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:58,928 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2024-10-11 11:00:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:00:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2024-10-11 11:00:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:58,930 INFO L225 Difference]: With dead ends: 86 [2024-10-11 11:00:58,930 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 11:00:58,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:00:58,934 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:58,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:00:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 11:00:58,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 11:00:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:00:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2024-10-11 11:00:58,956 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 47 [2024-10-11 11:00:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:58,956 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-10-11 11:00:58,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:00:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2024-10-11 11:00:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 11:00:58,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:58,958 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:00:58,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:00:58,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:58,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash 699467261, now seen corresponding path program 1 times [2024-10-11 11:00:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302575141] [2024-10-11 11:00:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:00:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:00:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:00:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:00:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:00:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:00:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:00:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:00:59,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:00:59,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302575141] [2024-10-11 11:00:59,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302575141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:00:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:00:59,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:00:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866571171] [2024-10-11 11:00:59,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:00:59,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:00:59,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:00:59,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:00:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:00:59,082 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:00:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:00:59,307 INFO L93 Difference]: Finished difference Result 208 states and 268 transitions. [2024-10-11 11:00:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:00:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-10-11 11:00:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:00:59,312 INFO L225 Difference]: With dead ends: 208 [2024-10-11 11:00:59,312 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 11:00:59,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:00:59,317 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 181 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:00:59,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 155 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:00:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 11:00:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 104. [2024-10-11 11:00:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:00:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2024-10-11 11:00:59,345 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 49 [2024-10-11 11:00:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:00:59,345 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2024-10-11 11:00:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:00:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2024-10-11 11:00:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 11:00:59,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:00:59,347 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:00:59,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:00:59,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:00:59,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:00:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash 262667406, now seen corresponding path program 1 times [2024-10-11 11:00:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:00:59,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553197643] [2024-10-11 11:00:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:00:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:00:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:01:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:01:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:01:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:01:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:01:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:01:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:01:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:01:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553197643] [2024-10-11 11:01:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553197643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:01:14,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:01:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:01:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695416711] [2024-10-11 11:01:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:01:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:01:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:01:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:01:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:01:14,797 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:01:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:01:15,215 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2024-10-11 11:01:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:01:15,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-10-11 11:01:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:01:15,217 INFO L225 Difference]: With dead ends: 168 [2024-10-11 11:01:15,218 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 11:01:15,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:01:15,219 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:01:15,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 164 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:01:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 11:01:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 136. [2024-10-11 11:01:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.1775700934579438) internal successors, (126), 107 states have internal predecessors, (126), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 11:01:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2024-10-11 11:01:15,245 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 50 [2024-10-11 11:01:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:01:15,246 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2024-10-11 11:01:15,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:01:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2024-10-11 11:01:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 11:01:15,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:15,248 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:15,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:01:15,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:15,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 963731984, now seen corresponding path program 1 times [2024-10-11 11:01:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:01:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386586068] [2024-10-11 11:01:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:01:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:01:15,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607896667] [2024-10-11 11:01:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:15,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:01:15,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:01:15,286 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 11:01:15,288 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 11:01:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:01:15,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:01:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:01:15,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:01:15,410 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:01:15,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:01:15,436 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 11:01:15,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:01:15,616 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 11:01:15,669 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:01:15,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:01:15 BoogieIcfgContainer [2024-10-11 11:01:15,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:01:15,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:01:15,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:01:15,676 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:01:15,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:00:57" (3/4) ... [2024-10-11 11:01:15,678 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:01:15,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:01:15,680 INFO L158 Benchmark]: Toolchain (without parser) took 19285.45ms. Allocated memory was 182.5MB in the beginning and 748.7MB in the end (delta: 566.2MB). Free memory was 113.1MB in the beginning and 491.9MB in the end (delta: -378.8MB). Peak memory consumption was 190.4MB. Max. memory is 16.1GB. [2024-10-11 11:01:15,680 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:01:15,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.41ms. Allocated memory is still 182.5MB. Free memory was 112.9MB in the beginning and 99.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:01:15,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.22ms. Allocated memory is still 182.5MB. Free memory was 99.2MB in the beginning and 96.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:01:15,681 INFO L158 Benchmark]: Boogie Preprocessor took 68.78ms. Allocated memory is still 182.5MB. Free memory was 96.6MB in the beginning and 154.3MB in the end (delta: -57.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-11 11:01:15,681 INFO L158 Benchmark]: RCFGBuilder took 471.97ms. Allocated memory is still 182.5MB. Free memory was 154.3MB in the beginning and 135.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:01:15,681 INFO L158 Benchmark]: TraceAbstraction took 18394.90ms. Allocated memory was 182.5MB in the beginning and 748.7MB in the end (delta: 566.2MB). Free memory was 134.8MB in the beginning and 491.9MB in the end (delta: -357.0MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2024-10-11 11:01:15,682 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 748.7MB. Free memory is still 491.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:01:15,683 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.41ms. Allocated memory is still 182.5MB. Free memory was 112.9MB in the beginning and 99.2MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.22ms. Allocated memory is still 182.5MB. Free memory was 99.2MB in the beginning and 96.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.78ms. Allocated memory is still 182.5MB. Free memory was 96.6MB in the beginning and 154.3MB in the end (delta: -57.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * RCFGBuilder took 471.97ms. Allocated memory is still 182.5MB. Free memory was 154.3MB in the beginning and 135.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18394.90ms. Allocated memory was 182.5MB in the beginning and 748.7MB in the end (delta: 566.2MB). Free memory was 134.8MB in the beginning and 491.9MB in the end (delta: -357.0MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 748.7MB. Free memory is still 491.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] signed long int var_1_10 = 9; [L28] signed long int var_1_11 = 0; [L29] signed short int var_1_12 = 1; [L30] signed long int var_1_14 = -16; [L31] unsigned char last_1_var_1_1 = 10; [L32] signed long int last_1_var_1_10 = 9; [L33] signed short int last_1_var_1_12 = 1; [L34] signed long int last_1_var_1_14 = -16; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L76] last_1_var_1_1 = var_1_1 [L77] last_1_var_1_10 = var_1_10 [L78] last_1_var_1_12 = var_1_12 [L79] last_1_var_1_14 = var_1_14 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L67] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L67] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L68] var_1_7 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_8=100, var_1_9=32] [L69] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_8=100, var_1_9=32] [L70] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L70] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=0, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L71] var_1_11 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L72] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L73] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L73] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L90] RET updateVariables() [L91] CALL step() [L38] unsigned char stepLocal_0 = last_1_var_1_10 > last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, stepLocal_0=0, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L39] COND FALSE !(((last_1_var_1_12 + last_1_var_1_1) < 10) || stepLocal_0) [L42] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=-16, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L44] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L45] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=9, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=32] [L45] COND FALSE !((10 << var_1_12) < (var_1_3 * var_1_14)) [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=10, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] [L50] COND TRUE var_1_12 <= 16 [L51] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=-244, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] [L91] RET step() [L92] CALL, EXPR property() [L82] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=-244, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] [L82] EXPR 10 << var_1_12 VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=-244, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] [L82] EXPR ((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=-244, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] [L82-L83] return ((((((var_1_12 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) < var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_12) < (var_1_3 * var_1_14)) ? (var_1_8 == ((signed short int) (var_1_12 + var_1_14))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((signed long int) var_1_11))) && ((((last_1_var_1_12 + last_1_var_1_1) < 10) || (last_1_var_1_10 > last_1_var_1_10)) ? (var_1_12 == ((signed short int) ((((((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) > (last_1_var_1_1)) ? (((var_1_3 + last_1_var_1_12) - ((((last_1_var_1_14) > (last_1_var_1_12)) ? (last_1_var_1_14) : (last_1_var_1_12))))) : (last_1_var_1_1))))) : (var_1_12 == ((signed short int) last_1_var_1_12)))) && (var_1_14 == ((signed long int) var_1_12)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=-244, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=9, last_1_var_1_12=1, last_1_var_1_14=-16, last_1_var_1_1=10, var_1_10=-2147483648, var_1_11=-2147483648, var_1_12=1, var_1_14=1, var_1_1=-244, var_1_3=-244, var_1_7=0, var_1_8=100, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 177 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 113 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 3927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 300/300 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 11:01:15,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i -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 de05dd5e3bf0aa71208c9225f4fdf36a7def96a9278aed9da8f88e67d49713ff --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:01:18,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:01:18,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:01:18,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:01:18,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:01:18,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:01:18,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:01:18,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:01:18,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:01:18,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:01:18,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:01:18,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:01:18,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:01:18,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:01:18,173 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:01:18,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:01:18,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:01:18,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:01:18,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:01:18,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:01:18,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:01:18,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:01:18,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:01:18,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:01:18,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:01:18,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:01:18,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:01:18,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:01:18,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:01:18,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:01:18,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:01:18,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:01:18,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:01:18,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:01:18,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:01:18,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:01:18,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:01:18,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:01:18,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:01:18,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:01:18,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:01:18,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:01:18,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:01:18,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:01:18,182 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:01:18,182 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 -> de05dd5e3bf0aa71208c9225f4fdf36a7def96a9278aed9da8f88e67d49713ff [2024-10-11 11:01:18,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:01:18,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:01:18,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:01:18,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:01:18,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:01:18,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i [2024-10-11 11:01:20,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:01:20,210 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:01:20,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i [2024-10-11 11:01:20,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4fb927f3/7f050ba33c92462b96e9d6329d0e3ced/FLAGaf68b1f8b [2024-10-11 11:01:20,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a4fb927f3/7f050ba33c92462b96e9d6329d0e3ced [2024-10-11 11:01:20,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:01:20,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:01:20,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:01:20,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:01:20,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:01:20,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b27041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20, skipping insertion in model container [2024-10-11 11:01:20,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:01:20,471 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i[915,928] [2024-10-11 11:01:20,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:01:20,537 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:01:20,551 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-9.i[915,928] [2024-10-11 11:01:20,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:01:20,597 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:01:20,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20 WrapperNode [2024-10-11 11:01:20,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:01:20,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:01:20,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:01:20,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:01:20,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,650 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2024-10-11 11:01:20,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:01:20,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:01:20,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:01:20,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:01:20,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,684 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 11:01:20,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:01:20,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:01:20,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:01:20,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:01:20,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (1/1) ... [2024-10-11 11:01:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:01:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:01:20,754 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 11:01:20,757 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 11:01:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:01:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:01:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:01:20,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:01:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:01:20,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:01:20,895 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:01:20,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:01:21,165 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:01:21,169 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:01:21,220 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:01:21,222 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:01:21,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:01:21 BoogieIcfgContainer [2024-10-11 11:01:21,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:01:21,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:01:21,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:01:21,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:01:21,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:01:20" (1/3) ... [2024-10-11 11:01:21,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d93091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:01:21, skipping insertion in model container [2024-10-11 11:01:21,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:01:20" (2/3) ... [2024-10-11 11:01:21,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d93091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:01:21, skipping insertion in model container [2024-10-11 11:01:21,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:01:21" (3/3) ... [2024-10-11 11:01:21,234 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-9.i [2024-10-11 11:01:21,249 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:01:21,250 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:01:21,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:01:21,325 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;@38da54d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:01:21,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:01:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:01:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 11:01:21,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:21,338 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:21,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:21,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash -206130345, now seen corresponding path program 1 times [2024-10-11 11:01:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:01:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497270905] [2024-10-11 11:01:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:21,359 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 11:01:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:01:21,363 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 11:01:21,364 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 11:01:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:21,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:01:21,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:01:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 11:01:21,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:01:21,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:01:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497270905] [2024-10-11 11:01:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497270905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:01:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:01:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:01:21,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649002381] [2024-10-11 11:01:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:01:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:01:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:01:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:01:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:01:21,553 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:01:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:01:21,592 INFO L93 Difference]: Finished difference Result 54 states and 86 transitions. [2024-10-11 11:01:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:01:21,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2024-10-11 11:01:21,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:01:21,602 INFO L225 Difference]: With dead ends: 54 [2024-10-11 11:01:21,602 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 11:01:21,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:01:21,608 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:01:21,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:01:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 11:01:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 11:01:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:01:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-11 11:01:21,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 43 [2024-10-11 11:01:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:01:21,647 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-11 11:01:21,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:01:21,647 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-11 11:01:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 11:01:21,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:21,649 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:21,655 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 11:01:21,853 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 11:01:21,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:21,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 649359895, now seen corresponding path program 1 times [2024-10-11 11:01:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:01:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208675260] [2024-10-11 11:01:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:21,855 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 11:01:21,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:01:21,857 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 11:01:21,858 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 11:01:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:21,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:01:21,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:01:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:01:22,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:01:22,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:01:22,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208675260] [2024-10-11 11:01:22,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208675260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:01:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:01:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:01:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052263931] [2024-10-11 11:01:22,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:01:22,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:01:22,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:01:22,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:01:22,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:01:22,362 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:01:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:01:22,535 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-10-11 11:01:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:01:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2024-10-11 11:01:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:01:22,538 INFO L225 Difference]: With dead ends: 76 [2024-10-11 11:01:22,538 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 11:01:22,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:01:22,541 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:01:22,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:01:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 11:01:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-11 11:01:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:01:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-10-11 11:01:22,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 43 [2024-10-11 11:01:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:01:22,566 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-10-11 11:01:22,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:01:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-10-11 11:01:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 11:01:22,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:01:22,570 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:01:22,575 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 (3)] Ended with exit code 0 [2024-10-11 11:01:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 11:01:22,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:01:22,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:01:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash -159986731, now seen corresponding path program 1 times [2024-10-11 11:01:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:01:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132735240] [2024-10-11 11:01:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:01:22,774 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 11:01:22,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:01:22,777 INFO L229 MonitoredProcess]: Starting monitored process 4 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 11:01:22,779 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 (4)] Waiting until timeout for monitored process [2024-10-11 11:01:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:01:22,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 11:01:22,853 INFO L278 TraceCheckSpWp]: Computing forward predicates...