./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.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_has-floats_file-83.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 f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:50:09,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:50:09,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:50:09,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:50:09,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:50:09,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:50:09,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:50:09,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:50:09,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:50:09,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:50:09,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:50:09,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:50:09,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:50:09,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:50:09,136 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:50:09,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:50:09,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:50:09,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:50:09,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:50:09,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:50:09,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:50:09,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:50:09,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:50:09,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:50:09,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:50:09,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:50:09,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:50:09,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:50:09,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:50:09,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:50:09,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:50:09,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:50:09,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:50:09,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:50:09,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:50:09,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:50:09,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:50:09,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:50:09,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:50:09,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:50:09,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:50:09,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:50:09,145 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 -> f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e [2024-10-11 10:50:09,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:50:09,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:50:09,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:50:09,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:50:09,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:50:09,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-10-11 10:50:10,807 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:50:10,962 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:50:10,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-10-11 10:50:10,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e759a255d/79713863057342f1b52fc6f93f06de9a/FLAG35b7a7454 [2024-10-11 10:50:11,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e759a255d/79713863057342f1b52fc6f93f06de9a [2024-10-11 10:50:11,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:50:11,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:50:11,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:50:11,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:50:11,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:50:11,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8c4742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11, skipping insertion in model container [2024-10-11 10:50:11,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:50:11,498 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i[917,930] [2024-10-11 10:50:11,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:50:11,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:50:11,595 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i[917,930] [2024-10-11 10:50:11,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:50:11,648 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:50:11,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11 WrapperNode [2024-10-11 10:50:11,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:50:11,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:50:11,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:50:11,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:50:11,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,693 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-11 10:50:11,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:50:11,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:50:11,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:50:11,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:50:11,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,720 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 10:50:11,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:50:11,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:50:11,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:50:11,736 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:50:11,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (1/1) ... [2024-10-11 10:50:11,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:50:11,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:50:11,776 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 10:50:11,782 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 10:50:11,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:50:11,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:50:11,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:50:11,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:50:11,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:50:11,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:50:11,921 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:50:11,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:50:12,186 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 10:50:12,187 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:50:12,209 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:50:12,209 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:50:12,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:50:12 BoogieIcfgContainer [2024-10-11 10:50:12,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:50:12,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:50:12,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:50:12,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:50:12,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:50:11" (1/3) ... [2024-10-11 10:50:12,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa7381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:50:12, skipping insertion in model container [2024-10-11 10:50:12,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:11" (2/3) ... [2024-10-11 10:50:12,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faa7381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:50:12, skipping insertion in model container [2024-10-11 10:50:12,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:50:12" (3/3) ... [2024-10-11 10:50:12,216 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-83.i [2024-10-11 10:50:12,229 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:50:12,229 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:50:12,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:50:12,288 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;@233db72e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:50:12,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:50:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:12,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 10:50:12,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:12,305 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:12,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:12,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash -985278410, now seen corresponding path program 1 times [2024-10-11 10:50:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:12,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53781717] [2024-10-11 10:50:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53781717] [2024-10-11 10:50:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53781717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:12,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:50:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235520012] [2024-10-11 10:50:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:50:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:50:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:50:12,606 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 10:50:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:12,632 INFO L93 Difference]: Finished difference Result 97 states and 161 transitions. [2024-10-11 10:50:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:50:12,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-10-11 10:50:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:12,640 INFO L225 Difference]: With dead ends: 97 [2024-10-11 10:50:12,640 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 10:50:12,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 10:50:12,645 INFO L432 NwaCegarLoop]: 67 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, 67 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 10:50:12,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:50:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 10:50:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 10:50:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-10-11 10:50:12,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 74 [2024-10-11 10:50:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:12,680 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-10-11 10:50:12,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 10:50:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-10-11 10:50:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 10:50:12,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:12,683 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:50:12,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:12,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1074585104, now seen corresponding path program 1 times [2024-10-11 10:50:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:12,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520478805] [2024-10-11 10:50:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520478805] [2024-10-11 10:50:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520478805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:50:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866971009] [2024-10-11 10:50:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:50:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:50:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:50:12,854 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:12,906 INFO L93 Difference]: Finished difference Result 117 states and 171 transitions. [2024-10-11 10:50:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:50:12,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-10-11 10:50:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:12,909 INFO L225 Difference]: With dead ends: 117 [2024-10-11 10:50:12,910 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 10:50:12,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:50:12,912 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 64 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:12,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 116 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:50:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 10:50:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 48. [2024-10-11 10:50:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2024-10-11 10:50:12,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 74 [2024-10-11 10:50:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:12,924 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2024-10-11 10:50:12,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2024-10-11 10:50:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 10:50:12,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:12,926 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:12,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:50:12,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1558464621, now seen corresponding path program 1 times [2024-10-11 10:50:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:12,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415754812] [2024-10-11 10:50:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:13,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415754812] [2024-10-11 10:50:13,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415754812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:13,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:13,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:50:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769413534] [2024-10-11 10:50:13,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:13,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:50:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:13,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:50:13,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:50:13,110 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:13,173 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2024-10-11 10:50:13,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:50:13,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2024-10-11 10:50:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:13,176 INFO L225 Difference]: With dead ends: 97 [2024-10-11 10:50:13,176 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 10:50:13,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 10:50:13,177 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:13,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 162 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:50:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 10:50:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 10:50:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-10-11 10:50:13,188 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 75 [2024-10-11 10:50:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-10-11 10:50:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-10-11 10:50:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 10:50:13,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:13,191 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:13,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:50:13,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:13,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash 910403700, now seen corresponding path program 1 times [2024-10-11 10:50:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133822902] [2024-10-11 10:50:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:15,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:15,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133822902] [2024-10-11 10:50:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133822902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:15,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:15,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:50:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413579242] [2024-10-11 10:50:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:15,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:50:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:15,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:50:15,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:50:15,257 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:15,621 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2024-10-11 10:50:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:50:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-10-11 10:50:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:15,623 INFO L225 Difference]: With dead ends: 129 [2024-10-11 10:50:15,626 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 10:50:15,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:50:15,627 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 91 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:15,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 143 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:50:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 10:50:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2024-10-11 10:50:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 53 states have internal predecessors, (68), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2024-10-11 10:50:15,644 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 76 [2024-10-11 10:50:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:15,644 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2024-10-11 10:50:15,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-10-11 10:50:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 10:50:15,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:15,647 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:50:15,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash -329440783, now seen corresponding path program 1 times [2024-10-11 10:50:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266271082] [2024-10-11 10:50:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266271082] [2024-10-11 10:50:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266271082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:16,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:16,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:50:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9603632] [2024-10-11 10:50:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:50:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:50:16,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:50:16,219 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:16,492 INFO L93 Difference]: Finished difference Result 159 states and 213 transitions. [2024-10-11 10:50:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:50:16,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-10-11 10:50:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:16,494 INFO L225 Difference]: With dead ends: 159 [2024-10-11 10:50:16,494 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 10:50:16,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:50:16,495 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:16,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 249 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:50:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 10:50:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2024-10-11 10:50:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 53 states have internal predecessors, (68), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2024-10-11 10:50:16,502 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 77 [2024-10-11 10:50:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:16,502 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2024-10-11 10:50:16,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-10-11 10:50:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 10:50:16,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:16,503 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:16,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:50:16,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:16,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -916246797, now seen corresponding path program 1 times [2024-10-11 10:50:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816778067] [2024-10-11 10:50:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816778067] [2024-10-11 10:50:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816778067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:50:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910253332] [2024-10-11 10:50:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:17,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:50:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:17,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:50:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:50:17,685 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:18,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:18,299 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2024-10-11 10:50:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:50:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-10-11 10:50:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:18,304 INFO L225 Difference]: With dead ends: 158 [2024-10-11 10:50:18,305 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 10:50:18,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:50:18,307 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 95 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:18,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 317 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:50:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 10:50:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 54. [2024-10-11 10:50:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-10-11 10:50:18,321 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 77 [2024-10-11 10:50:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:18,321 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-10-11 10:50:18,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-10-11 10:50:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 10:50:18,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:18,324 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:50:18,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2104912723, now seen corresponding path program 1 times [2024-10-11 10:50:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631977272] [2024-10-11 10:50:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631977272] [2024-10-11 10:50:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631977272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:18,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:50:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905819109] [2024-10-11 10:50:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:18,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:50:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:50:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:50:18,384 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:18,422 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2024-10-11 10:50:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:50:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-10-11 10:50:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:18,424 INFO L225 Difference]: With dead ends: 126 [2024-10-11 10:50:18,424 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 10:50:18,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:50:18,425 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:18,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:50:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 10:50:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2024-10-11 10:50:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-10-11 10:50:18,431 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 78 [2024-10-11 10:50:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:18,431 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-10-11 10:50:18,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 10:50:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-10-11 10:50:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 10:50:18,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:18,432 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:18,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:50:18,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1309722290, now seen corresponding path program 1 times [2024-10-11 10:50:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:18,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085616663] [2024-10-11 10:50:18,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:18,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:50:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:50:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:50:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:50:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:50:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:50:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:50:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:50:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:50:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:50:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:50:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 10:50:18,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:50:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085616663] [2024-10-11 10:50:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085616663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:18,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:50:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742457868] [2024-10-11 10:50:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:18,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:50:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:50:18,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:50:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:50:18,527 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 10:50:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:18,603 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2024-10-11 10:50:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:50:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2024-10-11 10:50:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:18,609 INFO L225 Difference]: With dead ends: 143 [2024-10-11 10:50:18,609 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 10:50:18,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 10:50:18,610 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 98 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:18,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:50:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 10:50:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2024-10-11 10:50:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-10-11 10:50:18,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 78 [2024-10-11 10:50:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:18,624 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-10-11 10:50:18,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 10:50:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-10-11 10:50:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 10:50:18,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:18,627 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:50:18,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:18,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:18,628 INFO L85 PathProgramCache]: Analyzing trace with hash -488335217, now seen corresponding path program 1 times [2024-10-11 10:50:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:50:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117828777] [2024-10-11 10:50:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:50:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:50:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678651631] [2024-10-11 10:50:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:18,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:50:18,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:50:18,665 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 10:50:18,677 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 10:50:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:50:18,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:50:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:50:18,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:50:18,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:50:18,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:50:18,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:50:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:50:19,023 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:50:19,068 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:50:19,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:50:19 BoogieIcfgContainer [2024-10-11 10:50:19,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:50:19,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:50:19,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:50:19,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:50:19,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:50:12" (3/4) ... [2024-10-11 10:50:19,077 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:50:19,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:50:19,083 INFO L158 Benchmark]: Toolchain (without parser) took 7727.20ms. Allocated memory was 163.6MB in the beginning and 348.1MB in the end (delta: 184.5MB). Free memory was 93.4MB in the beginning and 271.1MB in the end (delta: -177.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-10-11 10:50:19,083 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory was 122.0MB in the beginning and 121.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:50:19,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.71ms. Allocated memory is still 163.6MB. Free memory was 93.2MB in the beginning and 131.8MB in the end (delta: -38.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:50:19,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.95ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 129.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:50:19,083 INFO L158 Benchmark]: Boogie Preprocessor took 41.38ms. Allocated memory is still 163.6MB. Free memory was 129.0MB in the beginning and 124.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:50:19,083 INFO L158 Benchmark]: RCFGBuilder took 473.63ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 103.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 10:50:19,083 INFO L158 Benchmark]: TraceAbstraction took 6863.58ms. Allocated memory was 163.6MB in the beginning and 348.1MB in the end (delta: 184.5MB). Free memory was 102.5MB in the beginning and 271.1MB in the end (delta: -168.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 10:50:19,084 INFO L158 Benchmark]: Witness Printer took 7.20ms. Allocated memory is still 348.1MB. Free memory is still 271.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:50:19,085 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory was 122.0MB in the beginning and 121.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.71ms. Allocated memory is still 163.6MB. Free memory was 93.2MB in the beginning and 131.8MB in the end (delta: -38.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.95ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 129.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.38ms. Allocated memory is still 163.6MB. Free memory was 129.0MB in the beginning and 124.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 473.63ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 103.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6863.58ms. Allocated memory was 163.6MB in the beginning and 348.1MB in the end (delta: 184.5MB). Free memory was 102.5MB in the beginning and 271.1MB in the end (delta: -168.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Witness Printer took 7.20ms. Allocated memory is still 348.1MB. Free memory is still 271.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of bitwiseOr at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 127.625; [L27] double var_1_10 = 0.8; [L28] double var_1_11 = 128.75; [L29] double var_1_12 = 24.8; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] double var_1_17 = 1.5; [L34] unsigned short int last_1_var_1_1 = 128; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L96] RET updateLastVariables() [L97] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L77] var_1_10 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L78] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L79] var_1_11 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L80] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L81] var_1_16 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=126, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=126, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L82] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=126, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=126, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=126, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=126, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L97] RET updateVariables() [L98] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND FALSE !(var_1_15 <= stepLocal_2) [L60] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((double) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((double) var_1_10)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=126, var_1_16=126, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 730 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 516 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 8 MinimizatonAttempts, 139 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 767 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 601 ConstructedInterpolants, 0 QuantifiedInterpolants, 3567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1760/1760 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 10:50:19,136 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_has-floats_file-83.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 f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:50:21,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:50:21,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:50:21,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:50:21,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:50:21,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:50:21,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:50:21,358 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:50:21,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:50:21,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:50:21,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:50:21,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:50:21,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:50:21,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:50:21,361 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:50:21,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:50:21,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:50:21,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:50:21,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:50:21,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:50:21,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:50:21,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:50:21,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:50:21,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:50:21,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:50:21,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:50:21,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:50:21,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:50:21,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:50:21,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:50:21,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:50:21,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:50:21,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:50:21,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:50:21,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:50:21,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:50:21,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:50:21,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:50:21,366 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:50:21,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:50:21,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:50:21,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:50:21,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:50:21,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:50:21,369 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:50:21,369 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 -> f0343b048050125a5905463af6d7877f94dec42ff05d99e3ac24dce58bdf9f5e [2024-10-11 10:50:21,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:50:21,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:50:21,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:50:21,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:50:21,632 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:50:21,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-10-11 10:50:23,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:50:23,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:50:23,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i [2024-10-11 10:50:23,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2885c960d/73f862acf58b48d9a227bcd67f3983d1/FLAG83fe211d9 [2024-10-11 10:50:23,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2885c960d/73f862acf58b48d9a227bcd67f3983d1 [2024-10-11 10:50:23,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:50:23,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:50:23,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:50:23,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:50:23,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:50:23,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1e502b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23, skipping insertion in model container [2024-10-11 10:50:23,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:50:23,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i[917,930] [2024-10-11 10:50:23,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:50:23,548 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:50:23,558 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-83.i[917,930] [2024-10-11 10:50:23,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:50:23,604 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:50:23,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23 WrapperNode [2024-10-11 10:50:23,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:50:23,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:50:23,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:50:23,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:50:23,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,645 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-11 10:50:23,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:50:23,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:50:23,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:50:23,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:50:23,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,676 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 10:50:23,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:50:23,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:50:23,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:50:23,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:50:23,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (1/1) ... [2024-10-11 10:50:23,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:50:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:50:23,733 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 10:50:23,735 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 10:50:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:50:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:50:23,774 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:50:23,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:50:23,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:50:23,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:50:23,835 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:50:23,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:50:24,145 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:50:24,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:50:24,174 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:50:24,175 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:50:24,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:50:24 BoogieIcfgContainer [2024-10-11 10:50:24,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:50:24,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:50:24,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:50:24,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:50:24,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:50:23" (1/3) ... [2024-10-11 10:50:24,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489f643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:50:24, skipping insertion in model container [2024-10-11 10:50:24,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:50:23" (2/3) ... [2024-10-11 10:50:24,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7489f643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:50:24, skipping insertion in model container [2024-10-11 10:50:24,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:50:24" (3/3) ... [2024-10-11 10:50:24,182 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-83.i [2024-10-11 10:50:24,194 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:50:24,194 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:50:24,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:50:24,264 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;@4eb31af8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:50:24,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:50:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:50:24,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:24,276 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:24,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:24,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1627200233, now seen corresponding path program 1 times [2024-10-11 10:50:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:50:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720975711] [2024-10-11 10:50:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:24,293 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 10:50:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:50:24,297 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 10:50:24,298 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 10:50:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:24,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:50:24,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:50:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 10:50:24,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:50:24,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:50:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720975711] [2024-10-11 10:50:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720975711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:50:24,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:50:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:50:24,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13460739] [2024-10-11 10:50:24,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:50:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:50:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:50:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:50:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:50:24,530 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 10:50:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:50:24,614 INFO L93 Difference]: Finished difference Result 69 states and 117 transitions. [2024-10-11 10:50:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:50:24,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 70 [2024-10-11 10:50:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:50:24,627 INFO L225 Difference]: With dead ends: 69 [2024-10-11 10:50:24,627 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 10:50:24,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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 10:50:24,633 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:50:24,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:50:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 10:50:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 10:50:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 10:50:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-10-11 10:50:24,665 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 70 [2024-10-11 10:50:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:50:24,665 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-10-11 10:50:24,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 10:50:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-10-11 10:50:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 10:50:24,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:50:24,669 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:50:24,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:50:24,873 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 10:50:24,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:50:24,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:50:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1308179041, now seen corresponding path program 1 times [2024-10-11 10:50:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:50:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158237005] [2024-10-11 10:50:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:50:24,879 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 10:50:24,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:50:24,882 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 10:50:24,882 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 10:50:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:50:25,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 10:50:25,067 INFO L278 TraceCheckSpWp]: Computing forward predicates...