./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:44:54,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:44:54,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:44:54,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:44:54,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:44:54,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:44:54,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:44:54,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:44:54,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:44:54,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:44:54,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:44:54,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:44:54,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:44:54,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:44:54,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:44:54,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:44:54,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:44:54,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:44:54,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:44:54,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:44:54,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:44:54,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:44:54,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:44:54,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:44:54,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:44:54,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:44:54,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:44:54,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:44:54,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:44:54,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:44:54,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:44:54,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:44:54,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:44:54,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:44:54,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:44:54,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:44:54,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:44:54,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:44:54,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:44:54,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:44:54,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:44:54,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:44:54,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c [2024-11-10 06:44:54,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:44:54,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:44:54,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:44:54,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:44:54,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:44:54,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-10 06:44:56,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:44:56,593 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:44:56,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-10 06:44:56,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37bd70a26/7aa46a23952f4bac982406f5069671d0/FLAG2e81e940c [2024-11-10 06:44:56,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37bd70a26/7aa46a23952f4bac982406f5069671d0 [2024-11-10 06:44:56,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:44:56,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:44:56,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:44:56,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:44:56,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:44:56,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:44:56" (1/1) ... [2024-11-10 06:44:56,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261fd1de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:56, skipping insertion in model container [2024-11-10 06:44:56,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:44:56" (1/1) ... [2024-11-10 06:44:56,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:44:56,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-10 06:44:56,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:44:56,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:44:56,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-10 06:44:57,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:44:57,040 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:44:57,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57 WrapperNode [2024-11-10 06:44:57,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:44:57,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:44:57,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:44:57,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:44:57,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,116 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-10 06:44:57,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:44:57,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:44:57,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:44:57,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:44:57,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,146 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-11-10 06:44:57,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:44:57,157 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:44:57,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:44:57,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:44:57,158 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (1/1) ... [2024-11-10 06:44:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:44:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:44:57,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:44:57,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:44:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:44:57,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:44:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:44:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:44:57,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:44:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:44:57,318 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:44:57,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:44:57,499 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:44:57,499 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:44:57,509 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:44:57,510 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:44:57,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:57 BoogieIcfgContainer [2024-11-10 06:44:57,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:44:57,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:44:57,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:44:57,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:44:57,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:44:56" (1/3) ... [2024-11-10 06:44:57,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23382aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:44:57, skipping insertion in model container [2024-11-10 06:44:57,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:44:57" (2/3) ... [2024-11-10 06:44:57,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23382aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:44:57, skipping insertion in model container [2024-11-10 06:44:57,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:57" (3/3) ... [2024-11-10 06:44:57,518 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-10 06:44:57,533 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:44:57,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:44:57,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:44:57,605 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;@2c052ba6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:44:57,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:44:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:44:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:44:57,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:57,623 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:44:57,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:57,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1022657972, now seen corresponding path program 1 times [2024-11-10 06:44:57,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:57,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411978853] [2024-11-10 06:44:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:44:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:44:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:44:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:44:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:44:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 06:44:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:44:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 06:44:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:44:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 06:44:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:44:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 06:44:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 06:44:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 06:44:58,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:58,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411978853] [2024-11-10 06:44:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411978853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:58,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:44:58,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868077832] [2024-11-10 06:44:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:58,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:44:58,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:58,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:44:58,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:44:58,041 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:44:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:58,066 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2024-11-10 06:44:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:44:58,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-10 06:44:58,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:58,075 INFO L225 Difference]: With dead ends: 102 [2024-11-10 06:44:58,075 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 06:44:58,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-11-10 06:44:58,084 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:58,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:44:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 06:44:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 06:44:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:44:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-11-10 06:44:58,126 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 116 [2024-11-10 06:44:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:58,126 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-11-10 06:44:58,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:44:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-11-10 06:44:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:44:58,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:58,133 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:44:58,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:44:58,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1387831922, now seen corresponding path program 1 times [2024-11-10 06:44:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356702515] [2024-11-10 06:44:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:44:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 06:44:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 06:44:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 06:44:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 06:44:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 06:44:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 06:44:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 06:44:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 06:44:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 06:44:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 06:44:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:44:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:44:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 06:44:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 06:44:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 06:44:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 06:44:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 06:44:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:44:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 06:44:58,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:44:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356702515] [2024-11-10 06:44:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356702515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:44:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:44:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:44:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109528051] [2024-11-10 06:44:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:44:58,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:44:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:44:58,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:44:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:44:58,745 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:44:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:44:58,999 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2024-11-10 06:44:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:44:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-10 06:44:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:44:59,001 INFO L225 Difference]: With dead ends: 101 [2024-11-10 06:44:59,001 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 06:44:59,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 06:44:59,004 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 102 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:44:59,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 100 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:44:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 06:44:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 06:44:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:44:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2024-11-10 06:44:59,017 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 116 [2024-11-10 06:44:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:44:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-11-10 06:44:59,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:44:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2024-11-10 06:44:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:44:59,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:44:59,020 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:44:59,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:44:59,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:44:59,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:44:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2019631693, now seen corresponding path program 1 times [2024-11-10 06:44:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:44:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315212363] [2024-11-10 06:44:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:44:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:44:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:44:59,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:44:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:44:59,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:44:59,223 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:44:59,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:44:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:44:59,234 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:44:59,320 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:44:59,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:44:59 BoogieIcfgContainer [2024-11-10 06:44:59,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:44:59,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:44:59,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:44:59,323 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:44:59,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:44:57" (3/4) ... [2024-11-10 06:44:59,325 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:44:59,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:44:59,327 INFO L158 Benchmark]: Toolchain (without parser) took 2702.24ms. Allocated memory is still 172.0MB. Free memory was 104.2MB in the beginning and 133.3MB in the end (delta: -29.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:44:59,327 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:44:59,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.98ms. Allocated memory is still 172.0MB. Free memory was 104.0MB in the beginning and 135.5MB in the end (delta: -31.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 06:44:59,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.96ms. Allocated memory is still 172.0MB. Free memory was 135.5MB in the beginning and 133.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:44:59,328 INFO L158 Benchmark]: Boogie Preprocessor took 38.77ms. Allocated memory is still 172.0MB. Free memory was 133.5MB in the beginning and 130.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:44:59,328 INFO L158 Benchmark]: IcfgBuilder took 353.78ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 114.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 06:44:59,328 INFO L158 Benchmark]: TraceAbstraction took 1810.11ms. Allocated memory is still 172.0MB. Free memory was 114.0MB in the beginning and 134.3MB in the end (delta: -20.4MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-11-10 06:44:59,329 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 172.0MB. Free memory was 134.3MB in the beginning and 133.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:44:59,331 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.14ms. Allocated memory is still 109.1MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.98ms. Allocated memory is still 172.0MB. Free memory was 104.0MB in the beginning and 135.5MB in the end (delta: -31.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.96ms. Allocated memory is still 172.0MB. Free memory was 135.5MB in the beginning and 133.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.77ms. Allocated memory is still 172.0MB. Free memory was 133.5MB in the beginning and 130.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 353.78ms. Allocated memory is still 172.0MB. Free memory was 130.7MB in the beginning and 114.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1810.11ms. Allocated memory is still 172.0MB. Free memory was 114.0MB in the beginning and 134.3MB in the end (delta: -20.4MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 172.0MB. Free memory was 134.3MB in the beginning and 133.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 8.3; [L24] float var_1_3 = 2.25; [L25] float var_1_4 = 10.3; [L26] unsigned char var_1_6 = 0; [L27] signed long int var_1_7 = 128; [L28] float var_1_8 = 9.8; [L29] unsigned long int var_1_13 = 1; [L30] unsigned long int var_1_14 = 32; [L31] signed char var_1_15 = -10; [L32] signed char var_1_16 = 16; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = 1; [L35] signed char var_1_19 = 0; [L36] signed char var_1_20 = 32; [L37] signed short int var_1_21 = 256; [L38] signed char var_1_22 = 16; [L39] unsigned char var_1_23 = 0; [L40] signed short int last_1_var_1_21 = 256; VAL [isInitial=0, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_2=83/10, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L63] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_3=9/4, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L64] var_1_3 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L65] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_4=103/10, var_1_6=0, var_1_7=128, var_1_8=49/5] [L66] var_1_4 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L67] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=0, var_1_7=128, var_1_8=49/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_7=128, var_1_8=49/5] [L70] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L70] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128, var_1_8=49/5] [L71] var_1_8 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=32, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L73] var_1_14 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L75] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L75] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=16, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L76] var_1_16 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L77] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L78] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L78] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=25, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L79] var_1_17 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L80] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L81] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L81] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L82] var_1_18 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L83] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L84] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L84] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L85] var_1_19 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L87] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L87] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=32, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L88] var_1_20 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L89] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L90] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L90] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=1, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=16, var_1_23=0, var_1_6=-256, var_1_7=128] [L104] RET updateVariables() [L105] CALL step() [L44] var_1_13 = var_1_14 [L45] var_1_21 = last_1_var_1_21 [L46] var_1_22 = var_1_16 [L47] var_1_23 = var_1_6 VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L48] COND TRUE ((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4) [L49] var_1_1 = (var_1_23 && var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L51] signed char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=0, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L52] COND FALSE !(stepLocal_0 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=128] [L55] COND TRUE var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8) [L56] var_1_7 = (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((((((1.1f) < (var_1_2)) ? (1.1f) : (var_1_2))) > (var_1_3 * var_1_4)) ? (var_1_1 == ((unsigned char) (var_1_23 && var_1_6))) : 1) && ((var_1_4 <= (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))) * var_1_8)) ? (var_1_7 == ((signed long int) (((((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) > (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) ? ((((((var_1_22 + var_1_15)) > (var_1_15)) ? ((var_1_22 + var_1_15)) : (var_1_15)))) : (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))))))) : (var_1_7 == ((signed long int) var_1_22)))) && (var_1_13 == ((unsigned long int) var_1_14))) && ((var_1_22 != ((((var_1_22) < (var_1_21)) ? (var_1_22) : (var_1_21)))) ? (var_1_15 == ((signed char) ((((((10 + var_1_16)) < (var_1_17)) ? ((10 + var_1_16)) : (var_1_17))) - ((32 - var_1_18) + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20))))))) : 1)) && (var_1_21 == ((signed short int) last_1_var_1_21))) && (var_1_22 == ((signed char) var_1_16))) && (var_1_23 == ((unsigned char) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13=-2, var_1_14=-2, var_1_15=-10, var_1_16=0, var_1_17=10, var_1_18=31, var_1_19=1, var_1_1=0, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=-256, var_1_6=-256, var_1_7=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 133 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 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-11-10 06:44:59,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:45:01,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:45:01,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:45:01,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:45:01,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:45:01,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:45:01,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:45:01,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:45:01,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:45:01,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:45:01,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:45:01,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:45:01,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:45:01,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:45:01,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:45:01,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:45:01,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:45:01,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:45:01,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:45:01,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:45:01,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:45:01,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:45:01,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:45:01,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:45:01,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:45:01,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:45:01,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:45:01,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:45:01,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:45:01,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:45:01,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:45:01,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:45:01,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:45:01,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:45:01,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:45:01,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:45:01,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:45:01,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:45:01,862 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:45:01,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:45:01,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:45:01,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:45:01,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:45:01,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:45:01,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e232e31d2ef49a20919d421300baab40e8d32863fd290aed1658ebcf167ecf0c [2024-11-10 06:45:02,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:45:02,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:45:02,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:45:02,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:45:02,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:45:02,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-10 06:45:03,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:45:04,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:45:04,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-10 06:45:04,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362715de7/235a47eb65a04b7fae4075511bd7ec88/FLAG1beaef80b [2024-11-10 06:45:04,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362715de7/235a47eb65a04b7fae4075511bd7ec88 [2024-11-10 06:45:04,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:45:04,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:45:04,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:45:04,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:45:04,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:45:04,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e8a4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04, skipping insertion in model container [2024-11-10 06:45:04,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:45:04,709 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-10 06:45:04,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:45:04,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:45:04,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-63.i[917,930] [2024-11-10 06:45:04,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:45:04,839 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:45:04,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04 WrapperNode [2024-11-10 06:45:04,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:45:04,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:45:04,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:45:04,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:45:04,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,888 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 06:45:04,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:45:04,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:45:04,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:45:04,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:45:04,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,917 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-11-10 06:45:04,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:45:04,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:45:04,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:45:04,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:45:04,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (1/1) ... [2024-11-10 06:45:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:45:04,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:45:04,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:45:04,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:45:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:45:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:45:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:45:05,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:45:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:45:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:45:05,101 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:45:05,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:45:06,910 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:45:06,910 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:45:06,921 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:45:06,922 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:45:06,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:06 BoogieIcfgContainer [2024-11-10 06:45:06,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:45:06,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:45:06,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:45:06,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:45:06,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:45:04" (1/3) ... [2024-11-10 06:45:06,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b8d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:06, skipping insertion in model container [2024-11-10 06:45:06,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:45:04" (2/3) ... [2024-11-10 06:45:06,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b8d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:45:06, skipping insertion in model container [2024-11-10 06:45:06,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:45:06" (3/3) ... [2024-11-10 06:45:06,930 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-63.i [2024-11-10 06:45:06,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:45:06,957 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:45:07,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:45:07,039 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;@9f74863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:45:07,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:45:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:45:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:45:07,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:07,056 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:45:07,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:07,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1022657972, now seen corresponding path program 1 times [2024-11-10 06:45:07,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:07,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057426433] [2024-11-10 06:45:07,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:07,075 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-11-10 06:45:07,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:07,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:45:07,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:45:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:07,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:45:07,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-10 06:45:07,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:45:07,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:45:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057426433] [2024-11-10 06:45:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057426433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:45:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:45:07,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:45:07,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228623680] [2024-11-10 06:45:07,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:45:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:45:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:45:07,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:45:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:45:07,474 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:45:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:45:07,507 INFO L93 Difference]: Finished difference Result 102 states and 167 transitions. [2024-11-10 06:45:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:45:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-10 06:45:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:45:07,515 INFO L225 Difference]: With dead ends: 102 [2024-11-10 06:45:07,516 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 06:45:07,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-11-10 06:45:07,521 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:45:07,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:45:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 06:45:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 06:45:07,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 06:45:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2024-11-10 06:45:07,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 116 [2024-11-10 06:45:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:45:07,554 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2024-11-10 06:45:07,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 06:45:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2024-11-10 06:45:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 06:45:07,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:45:07,557 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 06:45:07,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:45:07,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:45:07,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:45:07,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:45:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1387831922, now seen corresponding path program 1 times [2024-11-10 06:45:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:45:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111588561] [2024-11-10 06:45:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:07,760 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-11-10 06:45:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:45:07,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:45:07,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:45:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:08,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 06:45:08,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-10 06:45:08,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:45:09,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:45:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111588561] [2024-11-10 06:45:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111588561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:45:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [152954643] [2024-11-10 06:45:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:45:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:45:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:45:09,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:45:09,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 06:45:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:45:09,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 06:45:09,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:45:41,672 WARN L286 SmtUtils]: Spent 5.64s 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) [2024-11-10 06:45:52,375 WARN L286 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:45:57,525 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 06:46:07,344 WARN L286 SmtUtils]: Spent 5.89s 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)