./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_no-floats_file-46.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 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:50:02,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:50:02,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:50:02,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:50:02,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:50:02,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:50:02,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:50:02,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:50:02,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:50:02,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:50:02,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:50:02,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:50:02,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:50:02,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:50:02,936 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:50:02,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:50:02,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:50:02,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:50:02,937 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:50:02,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:50:02,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:50:02,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:50:02,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:50:02,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:50:02,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:50:02,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:50:02,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:50:02,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:50:02,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:50:02,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:50:02,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:50:02,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:50:02,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:50:02,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:50:02,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:50:02,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:50:02,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:50:02,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:50:02,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:50:02,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:50:02,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:50:02,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:50:02,946 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 -> 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 [2024-11-16 15:50:03,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:50:03,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:50:03,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:50:03,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:50:03,190 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:50:03,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-11-16 15:50:04,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:50:04,871 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:50:04,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-11-16 15:50:04,882 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad09f1e95/c338e3dc2991478d94e5c37dd2751e78/FLAG931e6f9d8 [2024-11-16 15:50:04,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad09f1e95/c338e3dc2991478d94e5c37dd2751e78 [2024-11-16 15:50:04,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:50:04,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:50:04,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:50:04,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:50:04,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:50:04,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:50:04" (1/1) ... [2024-11-16 15:50:04,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@465cd681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:04, skipping insertion in model container [2024-11-16 15:50:04,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:50:04" (1/1) ... [2024-11-16 15:50:04,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:50:05,104 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_no-floats_file-46.i[916,929] [2024-11-16 15:50:05,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:50:05,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:50:05,161 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_no-floats_file-46.i[916,929] [2024-11-16 15:50:05,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:50:05,194 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:50:05,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05 WrapperNode [2024-11-16 15:50:05,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:50:05,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:50:05,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:50:05,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:50:05,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,234 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-16 15:50:05,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:50:05,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:50:05,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:50:05,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:50:05,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,261 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-16 15:50:05,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:50:05,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:50:05,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:50:05,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:50:05,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (1/1) ... [2024-11-16 15:50:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:50:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:50:05,322 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-16 15:50:05,325 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-16 15:50:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:50:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:50:05,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:50:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:50:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:50:05,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:50:05,454 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:50:05,456 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:50:05,750 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2024-11-16 15:50:05,772 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 15:50:05,774 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:50:05,802 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:50:05,802 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:50:05,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:50:05 BoogieIcfgContainer [2024-11-16 15:50:05,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:50:05,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:50:05,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:50:05,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:50:05,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:50:04" (1/3) ... [2024-11-16 15:50:05,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7440d352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:50:05, skipping insertion in model container [2024-11-16 15:50:05,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:05" (2/3) ... [2024-11-16 15:50:05,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7440d352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:50:05, skipping insertion in model container [2024-11-16 15:50:05,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:50:05" (3/3) ... [2024-11-16 15:50:05,814 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-46.i [2024-11-16 15:50:05,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:50:05,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:50:05,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:50:05,908 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;@5ffe1a8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:50:05,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:50:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:50:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 15:50:05,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:50:05,923 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:05,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:50:05,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:50:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 510594133, now seen corresponding path program 1 times [2024-11-16 15:50:05,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:50:05,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109708535] [2024-11-16 15:50:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:50:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:50:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:50:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:50:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:50:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:50:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:50:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:50:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:50:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:50:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:50:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:50:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:50:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:50:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:50:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:50:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:50:06,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:50:06,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109708535] [2024-11-16 15:50:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109708535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:50:06,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:50:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:50:06,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186401954] [2024-11-16 15:50:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:50:06,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:50:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:50:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:50:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:50:06,397 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 15:50:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:50:06,416 INFO L93 Difference]: Finished difference Result 114 states and 188 transitions. [2024-11-16 15:50:06,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:50:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-11-16 15:50:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:50:06,428 INFO L225 Difference]: With dead ends: 114 [2024-11-16 15:50:06,428 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 15:50:06,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-16 15:50:06,436 INFO L432 NwaCegarLoop]: 77 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, 77 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-16 15:50:06,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:50:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 15:50:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-16 15:50:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:50:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-16 15:50:06,472 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 102 [2024-11-16 15:50:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:50:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-16 15:50:06,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 15:50:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-16 15:50:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 15:50:06,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:50:06,476 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:06,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:50:06,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:50:06,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:50:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2054376118, now seen corresponding path program 1 times [2024-11-16 15:50:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:50:06,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306784434] [2024-11-16 15:50:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:50:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:50:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:50:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:50:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:50:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 15:50:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:50:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:50:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:50:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:50:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:50:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:50:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:50:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:50:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:50:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:50:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:50:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:50:06,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306784434] [2024-11-16 15:50:06,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306784434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:50:06,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:50:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:50:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361850045] [2024-11-16 15:50:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:50:06,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:50:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:50:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:50:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:50:06,859 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:50:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:50:06,944 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2024-11-16 15:50:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:50:06,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-16 15:50:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:50:06,948 INFO L225 Difference]: With dead ends: 127 [2024-11-16 15:50:06,948 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 15:50:06,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:50:06,950 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:50:06,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 191 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:50:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 15:50:06,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-11-16 15:50:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 53 states have internal predecessors, (64), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-16 15:50:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2024-11-16 15:50:06,973 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 102 [2024-11-16 15:50:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:50:06,974 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2024-11-16 15:50:06,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:50:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2024-11-16 15:50:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 15:50:06,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:50:06,976 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:06,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:50:06,977 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:50:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:50:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash -497780843, now seen corresponding path program 1 times [2024-11-16 15:50:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:50:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622407065] [2024-11-16 15:50:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:50:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:50:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713521405] [2024-11-16 15:50:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:07,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:50:07,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:50:07,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:50:07,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:50:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:50:07,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:50:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:50:07,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:50:07,395 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:50:07,396 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:50:07,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:50:07,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:50:07,604 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 15:50:07,695 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:50:07,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:50:07 BoogieIcfgContainer [2024-11-16 15:50:07,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:50:07,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:50:07,700 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:50:07,700 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:50:07,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:50:05" (3/4) ... [2024-11-16 15:50:07,704 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:50:07,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:50:07,706 INFO L158 Benchmark]: Toolchain (without parser) took 2808.42ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 142.3MB in the beginning and 157.7MB in the end (delta: -15.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-11-16 15:50:07,706 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:50:07,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.84ms. Allocated memory is still 172.0MB. Free memory was 141.8MB in the beginning and 127.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:50:07,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.74ms. Allocated memory is still 172.0MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:50:07,709 INFO L158 Benchmark]: Boogie Preprocessor took 35.82ms. Allocated memory is still 172.0MB. Free memory was 125.6MB in the beginning and 122.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:50:07,710 INFO L158 Benchmark]: IcfgBuilder took 531.37ms. Allocated memory is still 172.0MB. Free memory was 122.9MB in the beginning and 104.7MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 15:50:07,710 INFO L158 Benchmark]: TraceAbstraction took 1893.20ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 104.0MB in the beginning and 157.7MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:50:07,710 INFO L158 Benchmark]: Witness Printer took 5.88ms. Allocated memory is still 207.6MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:50:07,714 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.17ms. Allocated memory is still 125.8MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.84ms. Allocated memory is still 172.0MB. Free memory was 141.8MB in the beginning and 127.7MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.74ms. Allocated memory is still 172.0MB. Free memory was 127.7MB in the beginning and 125.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.82ms. Allocated memory is still 172.0MB. Free memory was 125.6MB in the beginning and 122.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 531.37ms. Allocated memory is still 172.0MB. Free memory was 122.9MB in the beginning and 104.7MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1893.20ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 104.0MB in the beginning and 157.7MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.88ms. Allocated memory is still 207.6MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed long int var_1_2 = 31; [L24] signed char var_1_4 = -8; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 1; [L29] signed short int var_1_10 = -4; [L30] signed short int var_1_12 = 32; [L31] signed char var_1_13 = -25; [L32] signed char var_1_16 = 4; [L33] unsigned char last_1_var_1_1 = 1; [L34] signed short int last_1_var_1_10 = -4; VAL [isInitial=0, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=31, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_1 = var_1_1 [L98] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=31, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-8, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L76] var_1_4 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_4 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 >= -128) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L78] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L78] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L80] var_1_6 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_7=0, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_7=0, var_1_8=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L83] var_1_7 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_8=1, var_1_9=1] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_8=1, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L86] var_1_9 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=32, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L89] var_1_12 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L90] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=4, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L109] RET updateVariables() [L110] CALL step() [L38] COND FALSE !(last_1_var_1_10 <= (var_1_12 / var_1_4)) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L43] signed long int stepLocal_1 = (((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13)); [L44] signed long int stepLocal_0 = var_1_13 / var_1_4; VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=0, stepLocal_1=-127, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L45] COND FALSE !((- var_1_2) >= 16.75) [L60] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=0, stepLocal_1=-127, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L62] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=0, stepLocal_1=-127, stepLocal_2=-25, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L63] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=0, stepLocal_1=-127, stepLocal_2=-25, var_1_10=-4, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L63] COND TRUE ((var_1_13 | var_1_13) + var_1_4) < stepLocal_2 [L64] var_1_10 = (var_1_12 - 256) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=0, stepLocal_1=-127, var_1_10=381, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L68] COND FALSE !(1 == var_1_4) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, stepLocal_0=0, stepLocal_1=-127, var_1_10=381, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((((- var_1_2) >= 16.75) ? (((var_1_13 / var_1_4) >= var_1_13) ? ((((((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) (var_1_6 || var_1_7)))) : (var_1_6 ? (var_1_1 == ((unsigned char) 1)) : (var_1_1 == ((unsigned char) var_1_7)))) : (var_1_1 == ((unsigned char) 1))) && ((1 == var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && ((((var_1_13 | var_1_13) + var_1_4) < var_1_13) ? (var_1_10 == ((signed short int) (var_1_12 - 256))) : (var_1_10 == ((signed short int) 128))) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=381, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L101-L102] return (((((- var_1_2) >= 16.75) ? (((var_1_13 / var_1_4) >= var_1_13) ? ((((((var_1_4) < (var_1_13)) ? (var_1_4) : (var_1_13))) > -32) ? (var_1_1 == ((unsigned char) 0)) : (var_1_1 == ((unsigned char) (var_1_6 || var_1_7)))) : (var_1_6 ? (var_1_1 == ((unsigned char) 1)) : (var_1_1 == ((unsigned char) var_1_7)))) : (var_1_1 == ((unsigned char) 1))) && ((1 == var_1_4) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && ((((var_1_13 | var_1_13) + var_1_4) < var_1_13) ? (var_1_10 == ((signed short int) (var_1_12 - 256))) : (var_1_10 == ((signed short int) 128)))) && ((last_1_var_1_10 <= (var_1_12 / var_1_4)) ? (last_1_var_1_1 ? (var_1_13 == ((signed char) var_1_16)) : 1) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=381, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-4, last_1_var_1_1=1, var_1_10=381, var_1_12=637, var_1_13=-25, var_1_16=-23, var_1_1=1, var_1_2=-2147483648, var_1_4=-127, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 147 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 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-16 15:50:07,740 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_no-floats_file-46.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 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:50:09,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:50:09,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:50:09,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:50:09,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:50:09,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:50:09,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:50:09,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:50:09,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:50:09,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:50:09,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:50:09,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:50:09,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:50:09,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:50:09,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:50:09,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:50:09,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:50:09,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:50:09,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:50:09,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:50:09,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:50:09,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:50:09,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:50:09,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:50:09,966 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:50:09,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:50:09,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:50:09,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:50:09,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:50:09,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:50:09,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:50:09,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:50:09,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:50:09,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:50:09,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:50:09,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:50:09,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:50:09,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:50:09,972 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:50:09,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:50:09,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:50:09,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:50:09,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:50:09,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:50:09,974 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 -> 92146e8486cd1fa4cd649b10702b8ab5c79eabd98f42ded8c5df34143d7c4a50 [2024-11-16 15:50:10,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:50:10,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:50:10,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:50:10,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:50:10,319 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:50:10,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-11-16 15:50:11,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:50:12,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:50:12,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-46.i [2024-11-16 15:50:12,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a97d45c/511d8ac4d7934ccb98755b2c66eb18b6/FLAGb3752bdb5 [2024-11-16 15:50:12,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37a97d45c/511d8ac4d7934ccb98755b2c66eb18b6 [2024-11-16 15:50:12,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:50:12,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:50:12,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:50:12,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:50:12,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:50:12,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bca7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12, skipping insertion in model container [2024-11-16 15:50:12,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:50:12,595 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_no-floats_file-46.i[916,929] [2024-11-16 15:50:12,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:50:12,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:50:12,705 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_no-floats_file-46.i[916,929] [2024-11-16 15:50:12,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:50:12,758 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:50:12,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12 WrapperNode [2024-11-16 15:50:12,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:50:12,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:50:12,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:50:12,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:50:12,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,799 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-16 15:50:12,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:50:12,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:50:12,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:50:12,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:50:12,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,832 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-16 15:50:12,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:50:12,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:50:12,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:50:12,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:50:12,862 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (1/1) ... [2024-11-16 15:50:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:50:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:50:12,896 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-16 15:50:12,900 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-16 15:50:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:50:12,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:50:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:50:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:50:12,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:50:12,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:50:13,003 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:50:13,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:50:13,870 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:50:13,871 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:50:13,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:50:13,886 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:50:13,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:50:13 BoogieIcfgContainer [2024-11-16 15:50:13,896 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:50:13,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:50:13,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:50:13,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:50:13,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:50:12" (1/3) ... [2024-11-16 15:50:13,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecf2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:50:13, skipping insertion in model container [2024-11-16 15:50:13,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:50:12" (2/3) ... [2024-11-16 15:50:13,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ecf2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:50:13, skipping insertion in model container [2024-11-16 15:50:13,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:50:13" (3/3) ... [2024-11-16 15:50:13,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-46.i [2024-11-16 15:50:13,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:50:13,916 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:50:13,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:50:13,979 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;@4241f3dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:50:13,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:50:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:50:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 15:50:13,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:50:13,996 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:13,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:50:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:50:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1997631288, now seen corresponding path program 1 times [2024-11-16 15:50:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:50:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959751491] [2024-11-16 15:50:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:14,018 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-16 15:50:14,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:50:14,022 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-16 15:50:14,023 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-16 15:50:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:14,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:50:14,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:50:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-16 15:50:14,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:50:14,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:50:14,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959751491] [2024-11-16 15:50:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959751491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:50:14,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:50:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:50:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364896414] [2024-11-16 15:50:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:50:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:50:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:50:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:50:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:50:14,257 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:50:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:50:14,280 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2024-11-16 15:50:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:50:14,283 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-16 15:50:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:50:14,291 INFO L225 Difference]: With dead ends: 100 [2024-11-16 15:50:14,291 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 15:50:14,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-16 15:50:14,306 INFO L432 NwaCegarLoop]: 71 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, 71 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-16 15:50:14,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:50:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 15:50:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-16 15:50:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 15:50:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2024-11-16 15:50:14,339 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 99 [2024-11-16 15:50:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:50:14,339 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2024-11-16 15:50:14,340 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:50:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2024-11-16 15:50:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 15:50:14,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:50:14,343 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:14,350 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-16 15:50:14,544 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-16 15:50:14,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:50:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:50:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1465592313, now seen corresponding path program 1 times [2024-11-16 15:50:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:50:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607799067] [2024-11-16 15:50:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:14,547 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-16 15:50:14,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:50:14,550 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-16 15:50:14,551 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-16 15:50:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:14,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 15:50:14,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:50:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 15:50:15,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:50:15,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:50:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607799067] [2024-11-16 15:50:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607799067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:50:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:50:15,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:50:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733966483] [2024-11-16 15:50:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:50:15,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:50:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:50:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:50:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:50:15,250 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:50:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:50:16,008 INFO L93 Difference]: Finished difference Result 159 states and 227 transitions. [2024-11-16 15:50:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:50:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-16 15:50:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:50:16,028 INFO L225 Difference]: With dead ends: 159 [2024-11-16 15:50:16,028 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 15:50:16,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:50:16,030 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 15:50:16,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 209 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 15:50:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 15:50:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2024-11-16 15:50:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 71 states have internal predecessors, (89), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 15:50:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 153 transitions. [2024-11-16 15:50:16,064 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 153 transitions. Word has length 99 [2024-11-16 15:50:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:50:16,065 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 153 transitions. [2024-11-16 15:50:16,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 15:50:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 153 transitions. [2024-11-16 15:50:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 15:50:16,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:50:16,067 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:50:16,075 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-16 15:50:16,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-16 15:50:16,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:50:16,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:50:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1436963162, now seen corresponding path program 1 times [2024-11-16 15:50:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:50:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544633182] [2024-11-16 15:50:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:50:16,271 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-16 15:50:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:50:16,295 INFO L229 MonitoredProcess]: Starting monitored process 4 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-16 15:50:16,296 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 (4)] Waiting until timeout for monitored process [2024-11-16 15:50:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:50:16,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 15:50:16,426 INFO L278 TraceCheckSpWp]: Computing forward predicates...