./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:58:05,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:58:05,639 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:58:05,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:58:05,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:58:05,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:58:05,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:58:05,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:58:05,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:58:05,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:58:05,675 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:58:05,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:58:05,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:58:05,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:58:05,679 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:58:05,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:58:05,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:58:05,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:58:05,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:58:05,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:58:05,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:58:05,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:58:05,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:58:05,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:58:05,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:58:05,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:58:05,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:58:05,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:58:05,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:58:05,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:58:05,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:58:05,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:58:05,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:05,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:58:05,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:58:05,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:58:05,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:58:05,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:58:05,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:58:05,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:58:05,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:58:05,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:58:05,690 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-10-11 10:58:05,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:58:06,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:58:06,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:58:06,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:58:06,012 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:58:06,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-11 10:58:07,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:58:07,715 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:58:07,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-11 10:58:07,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a1ec47354/98b91c8d7aca47208d4099df8bcfbbd0/FLAG8bafbb425 [2024-10-11 10:58:07,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a1ec47354/98b91c8d7aca47208d4099df8bcfbbd0 [2024-10-11 10:58:07,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:58:07,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:58:07,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:07,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:58:07,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:58:07,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:07" (1/1) ... [2024-10-11 10:58:07,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cda16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:07, skipping insertion in model container [2024-10-11 10:58:07,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:07" (1/1) ... [2024-10-11 10:58:07,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:58:07,971 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-11 10:58:08,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:08,047 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:58:08,061 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-11 10:58:08,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:08,118 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:58:08,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08 WrapperNode [2024-10-11 10:58:08,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:08,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:08,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:58:08,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:58:08,128 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:58:08" (1/1) ... [2024-10-11 10:58:08,137 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:58:08" (1/1) ... [2024-10-11 10:58:08,176 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-10-11 10:58:08,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:08,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:58:08,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:58:08,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:58:08,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,214 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:58:08,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:58:08,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:58:08,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:58:08,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:58:08,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (1/1) ... [2024-10-11 10:58:08,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:58:08,273 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:58:08,275 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:58:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:58:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:58:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:58:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:58:08,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:58:08,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:58:08,396 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:58:08,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:58:08,672 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 10:58:08,672 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:58:08,737 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:58:08,739 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:58:08,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:08 BoogieIcfgContainer [2024-10-11 10:58:08,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:58:08,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:58:08,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:58:08,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:58:08,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:58:07" (1/3) ... [2024-10-11 10:58:08,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bda82a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:08, skipping insertion in model container [2024-10-11 10:58:08,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:08" (2/3) ... [2024-10-11 10:58:08,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bda82a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:08, skipping insertion in model container [2024-10-11 10:58:08,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:08" (3/3) ... [2024-10-11 10:58:08,748 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-11 10:58:08,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:58:08,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:58:08,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:58:08,835 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;@99fc5b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:58:08,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:58:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:58:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:58:08,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:08,853 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:08,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1059842933, now seen corresponding path program 1 times [2024-10-11 10:58:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:08,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88013507] [2024-10-11 10:58:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:08,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:58:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:58:09,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88013507] [2024-10-11 10:58:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88013507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:09,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:09,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:58:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915226431] [2024-10-11 10:58:09,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:58:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:09,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:58:09,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:58:09,317 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:58:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:09,360 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2024-10-11 10:58:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:58:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2024-10-11 10:58:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:09,377 INFO L225 Difference]: With dead ends: 85 [2024-10-11 10:58:09,377 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 10:58:09,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:58:09,387 INFO L432 NwaCegarLoop]: 59 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, 59 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:58:09,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:58:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 10:58:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 10:58:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:58:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-11 10:58:09,438 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 98 [2024-10-11 10:58:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:09,439 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-11 10:58:09,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:58:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-11 10:58:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:58:09,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:09,445 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:58:09,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:09,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1330050187, now seen corresponding path program 1 times [2024-10-11 10:58:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:09,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995240398] [2024-10-11 10:58:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:58:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:58:11,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995240398] [2024-10-11 10:58:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995240398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:58:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604234360] [2024-10-11 10:58:11,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:11,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:58:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:11,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:58:11,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:58:11,414 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:58:11,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:11,662 INFO L93 Difference]: Finished difference Result 106 states and 152 transitions. [2024-10-11 10:58:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:58:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-11 10:58:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:11,665 INFO L225 Difference]: With dead ends: 106 [2024-10-11 10:58:11,665 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 10:58:11,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:58:11,667 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 35 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:11,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 223 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:58:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 10:58:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-11 10:58:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 10:58:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2024-10-11 10:58:11,692 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 98 [2024-10-11 10:58:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:11,692 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2024-10-11 10:58:11,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:58:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2024-10-11 10:58:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:58:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:11,698 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:58:11,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1566471563, now seen corresponding path program 1 times [2024-10-11 10:58:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470900782] [2024-10-11 10:58:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:58:11,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:58:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:58:11,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:58:11,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:58:11,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:58:11,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:58:11,847 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:58:11,924 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:58:11,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:58:11 BoogieIcfgContainer [2024-10-11 10:58:11,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:58:11,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:58:11,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:58:11,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:58:11,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:08" (3/4) ... [2024-10-11 10:58:11,935 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:58:11,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:58:11,938 INFO L158 Benchmark]: Toolchain (without parser) took 4192.42ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 136.6MB in the beginning and 116.3MB in the end (delta: 20.3MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-10-11 10:58:11,940 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:58:11,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.75ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 123.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:58:11,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.23ms. Allocated memory is still 176.2MB. Free memory was 123.0MB in the beginning and 120.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:58:11,941 INFO L158 Benchmark]: Boogie Preprocessor took 55.90ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 118.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:58:11,942 INFO L158 Benchmark]: RCFGBuilder took 505.12ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 132.2MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 10:58:11,946 INFO L158 Benchmark]: TraceAbstraction took 3189.74ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 131.4MB in the beginning and 116.3MB in the end (delta: 15.2MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2024-10-11 10:58:11,946 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 211.8MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:58:11,948 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.75ms. Allocated memory is still 176.2MB. Free memory was 136.6MB in the beginning and 123.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.23ms. Allocated memory is still 176.2MB. Free memory was 123.0MB in the beginning and 120.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.90ms. Allocated memory is still 176.2MB. Free memory was 120.5MB in the beginning and 118.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 505.12ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 132.2MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3189.74ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 131.4MB in the beginning and 116.3MB in the end (delta: 15.2MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 211.8MB. Free memory is still 116.3MB. 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 to_int at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000000; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = -32; [L26] signed long int var_1_9 = 100; [L27] signed long int var_1_12 = 25; [L28] signed long int var_1_13 = 63; [L29] signed long int var_1_14 = 0; [L30] signed long int var_1_15 = 0; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] signed long int last_1_var_1_9 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L70] var_1_12 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L73] var_1_13 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L76] var_1_14 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L77] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L79] var_1_15 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L80] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L82] var_1_17 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L83] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L85] var_1_19 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L101] RET updateVariables() [L102] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=-65536, var_1_1=0, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((signed long int) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((signed long int) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=126, var_1_17=126, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 122 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 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:58:11,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:58:14,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:58:14,361 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:58:14,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:58:14,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:58:14,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:58:14,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:58:14,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:58:14,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:58:14,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:58:14,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:58:14,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:58:14,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:58:14,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:58:14,420 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:58:14,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:58:14,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:58:14,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:58:14,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:58:14,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:58:14,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:58:14,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:58:14,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:58:14,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:58:14,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:58:14,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:58:14,425 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:58:14,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:58:14,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:58:14,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:58:14,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:58:14,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:58:14,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:58:14,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:58:14,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:14,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:58:14,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:58:14,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:58:14,429 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:58:14,430 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:58:14,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:58:14,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:58:14,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:58:14,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:58:14,431 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:58:14,431 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-10-11 10:58:14,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:58:14,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:58:14,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:58:14,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:58:14,808 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:58:14,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-11 10:58:16,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:58:16,550 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:58:16,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-11 10:58:16,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/108c56ef2/dd385f21d6e04cf18a710d8dfa73d190/FLAGc7d1954b0 [2024-10-11 10:58:16,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/108c56ef2/dd385f21d6e04cf18a710d8dfa73d190 [2024-10-11 10:58:16,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:58:16,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:58:16,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:16,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:58:16,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:58:16,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:16,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a64434b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16, skipping insertion in model container [2024-10-11 10:58:16,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:16,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:58:16,839 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-11 10:58:16,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:16,916 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:58:16,930 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-10-11 10:58:16,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:16,980 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:58:16,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16 WrapperNode [2024-10-11 10:58:16,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:16,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:16,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:58:16,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:58:16,989 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:58:16" (1/1) ... [2024-10-11 10:58:17,001 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:58:16" (1/1) ... [2024-10-11 10:58:17,034 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-10-11 10:58:17,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:17,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:58:17,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:58:17,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:58:17,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,066 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:58:17,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:58:17,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:58:17,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:58:17,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:58:17,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (1/1) ... [2024-10-11 10:58:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:58:17,127 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:58:17,129 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:58:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:58:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:58:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:58:17,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:58:17,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:58:17,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:58:17,252 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:58:17,254 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:58:22,662 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 10:58:22,662 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:58:22,710 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:58:22,710 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:58:22,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:22 BoogieIcfgContainer [2024-10-11 10:58:22,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:58:22,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:58:22,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:58:22,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:58:22,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:58:16" (1/3) ... [2024-10-11 10:58:22,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dff2a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:22, skipping insertion in model container [2024-10-11 10:58:22,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:16" (2/3) ... [2024-10-11 10:58:22,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dff2a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:22, skipping insertion in model container [2024-10-11 10:58:22,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:22" (3/3) ... [2024-10-11 10:58:22,719 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-10-11 10:58:22,736 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:58:22,737 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:58:22,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:58:22,821 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;@3b8b8784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:58:22,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:58:22,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:58:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:58:22,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:22,839 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:22,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:22,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1059842933, now seen corresponding path program 1 times [2024-10-11 10:58:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:58:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763691637] [2024-10-11 10:58:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:22,877 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:58:22,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:58:22,881 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:58:22,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 (2)] Waiting until timeout for monitored process [2024-10-11 10:58:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:23,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:58:23,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:58:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 10:58:23,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:58:23,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:58:23,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763691637] [2024-10-11 10:58:23,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763691637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:23,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:23,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:58:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972541416] [2024-10-11 10:58:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:23,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:58:23,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:58:23,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:58:23,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:58:23,196 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:58:26,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:58:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:26,600 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2024-10-11 10:58:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:58:26,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-11 10:58:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:26,641 INFO L225 Difference]: With dead ends: 85 [2024-10-11 10:58:26,641 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 10:58:26,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:58:26,647 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:26,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 10:58:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 10:58:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 10:58:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:58:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-11 10:58:26,687 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 98 [2024-10-11 10:58:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:26,688 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-11 10:58:26,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:58:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-11 10:58:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:58:26,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:26,692 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:26,700 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:58:26,893 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:58:26,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:26,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1330050187, now seen corresponding path program 1 times [2024-10-11 10:58:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:58:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283230436] [2024-10-11 10:58:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:26,897 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:58:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:58:26,901 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:58:26,902 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:58:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:58:27,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:58:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:58:27,274 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-11 10:58:27,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [507854778] [2024-10-11 10:58:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:27,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:58:27,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:58:27,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:58:27,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 10:58:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:27,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 10:58:27,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:59:02,270 WARN L286 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:59:07,797 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:59:17,619 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:59:25,987 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 10:59:33,496 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)