./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.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 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:48:02,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:48:02,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:48:02,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:48:02,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:48:02,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:48:02,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:48:02,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:48:02,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:48:02,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:48:02,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:48:02,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:48:02,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:48:02,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:48:02,844 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:48:02,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:48:02,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:48:02,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:48:02,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:48:02,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:48:02,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:48:02,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:48:02,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:48:02,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:48:02,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:48:02,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:48:02,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:48:02,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:48:02,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:48:02,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:48:02,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:48:02,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:48:02,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:48:02,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:48:02,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:48:02,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:48:02,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:48:02,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:48:02,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:48:02,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:48:02,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:48:02,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:48:02,855 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 -> 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f [2024-11-20 07:48:03,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:48:03,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:48:03,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:48:03,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:48:03,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:48:03,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-20 07:48:04,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:48:04,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:48:04,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-20 07:48:04,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b857bcd5b/c1e4824e7b2348a9a918dff33e84bdd5/FLAGdae6d6003 [2024-11-20 07:48:04,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b857bcd5b/c1e4824e7b2348a9a918dff33e84bdd5 [2024-11-20 07:48:04,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:48:04,611 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:48:04,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:48:04,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:48:04,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:48:04,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773f1bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04, skipping insertion in model container [2024-11-20 07:48:04,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:48:04,773 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_operatoramount_amount25_file-8.i[914,927] [2024-11-20 07:48:04,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:48:04,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:48:04,823 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_operatoramount_amount25_file-8.i[914,927] [2024-11-20 07:48:04,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:48:04,863 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:48:04,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04 WrapperNode [2024-11-20 07:48:04,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:48:04,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:48:04,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:48:04,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:48:04,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,901 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-20 07:48:04,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:48:04,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:48:04,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:48:04,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:48:04,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,929 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-20 07:48:04,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:48:04,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:48:04,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:48:04,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:48:04,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (1/1) ... [2024-11-20 07:48:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:48:04,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:48:04,975 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-20 07:48:04,981 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-20 07:48:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:48:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:48:05,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:48:05,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:48:05,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:48:05,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:48:05,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:48:05,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:48:05,343 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 07:48:05,343 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:48:05,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:48:05,370 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:48:05,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:48:05 BoogieIcfgContainer [2024-11-20 07:48:05,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:48:05,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:48:05,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:48:05,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:48:05,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:48:04" (1/3) ... [2024-11-20 07:48:05,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9e8d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:48:05, skipping insertion in model container [2024-11-20 07:48:05,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:04" (2/3) ... [2024-11-20 07:48:05,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9e8d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:48:05, skipping insertion in model container [2024-11-20 07:48:05,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:48:05" (3/3) ... [2024-11-20 07:48:05,377 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-8.i [2024-11-20 07:48:05,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:48:05,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:48:05,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:48:05,436 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;@49e21419, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:48:05,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:48:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:05,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:05,451 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:05,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:05,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:05,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times [2024-11-20 07:48:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:48:05,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367391101] [2024-11-20 07:48:05,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:05,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:48:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:48:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:48:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:48:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:48:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:48:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:48:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:48:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:48:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:48:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:48:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:48:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:48:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:48:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:48:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:48:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:48:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:48:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:48:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:48:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:48:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 07:48:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:48:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367391101] [2024-11-20 07:48:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367391101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:48:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:48:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:48:05,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552184428] [2024-11-20 07:48:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:48:05,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:48:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:48:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:48:05,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:48:05,781 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 07:48:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:48:05,801 INFO L93 Difference]: Finished difference Result 103 states and 176 transitions. [2024-11-20 07:48:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:48:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-20 07:48:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:48:05,808 INFO L225 Difference]: With dead ends: 103 [2024-11-20 07:48:05,808 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 07:48:05,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-20 07:48:05,814 INFO L432 NwaCegarLoop]: 74 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, 74 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-20 07:48:05,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:48:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 07:48:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 07:48:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-20 07:48:05,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125 [2024-11-20 07:48:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:48:05,856 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-20 07:48:05,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 07:48:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-20 07:48:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:05,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:05,859 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:05,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:48:05,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:05,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times [2024-11-20 07:48:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:48:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987399379] [2024-11-20 07:48:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:48:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:48:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:48:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:48:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:48:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:48:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:48:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:48:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:48:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:48:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:48:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:48:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:48:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:48:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:48:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:48:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:48:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:48:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:48:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:48:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:48:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 07:48:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:48:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987399379] [2024-11-20 07:48:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987399379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:48:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:48:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:48:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578754378] [2024-11-20 07:48:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:48:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:48:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:48:06,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:48:06,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:48:06,245 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 07:48:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:48:06,366 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2024-11-20 07:48:06,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:48:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-20 07:48:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:48:06,368 INFO L225 Difference]: With dead ends: 99 [2024-11-20 07:48:06,368 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 07:48:06,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:48:06,370 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:48:06,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 69 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:48:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 07:48:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 07:48:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-20 07:48:06,387 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125 [2024-11-20 07:48:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:48:06,390 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-20 07:48:06,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 07:48:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-20 07:48:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:06,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:06,394 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:48:06,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times [2024-11-20 07:48:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:48:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129278972] [2024-11-20 07:48:06,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:06,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:48:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:48:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:48:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:48:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:48:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:48:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:48:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:48:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:48:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:48:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:48:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:48:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:48:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:48:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 07:48:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 07:48:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 07:48:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 07:48:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 07:48:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 07:48:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 07:48:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 07:48:06,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:48:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129278972] [2024-11-20 07:48:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129278972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:48:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488273763] [2024-11-20 07:48:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:48:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:48:06,759 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-20 07:48:06,761 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-20 07:48:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:06,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 07:48:06,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:48:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-20 07:48:07,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:48:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 07:48:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488273763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:48:07,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:48:07,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 07:48:07,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9768868] [2024-11-20 07:48:07,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:48:07,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:48:07,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:48:07,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:48:07,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:48:07,395 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 07:48:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:48:07,594 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-11-20 07:48:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:48:07,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-11-20 07:48:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:48:07,600 INFO L225 Difference]: With dead ends: 107 [2024-11-20 07:48:07,601 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 07:48:07,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:48:07,602 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:48:07,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:48:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 07:48:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-20 07:48:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-11-20 07:48:07,621 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125 [2024-11-20 07:48:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:48:07,622 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-11-20 07:48:07,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 07:48:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-11-20 07:48:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:07,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:07,623 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:07,632 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-20 07:48:07,827 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-20 07:48:07,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:07,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times [2024-11-20 07:48:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:48:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836894773] [2024-11-20 07:48:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:48:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:48:07,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:48:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:48:07,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:48:07,986 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:48:07,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:48:07,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:48:07,991 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 07:48:08,084 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:48:08,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:48:08 BoogieIcfgContainer [2024-11-20 07:48:08,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:48:08,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:48:08,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:48:08,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:48:08,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:48:05" (3/4) ... [2024-11-20 07:48:08,092 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:48:08,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:48:08,094 INFO L158 Benchmark]: Toolchain (without parser) took 3483.06ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 111.2MB in the beginning and 182.3MB in the end (delta: -71.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:48:08,096 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 91.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:48:08,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.58ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 96.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:48:08,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.42ms. Allocated memory is still 180.4MB. Free memory was 96.8MB in the beginning and 94.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:48:08,096 INFO L158 Benchmark]: Boogie Preprocessor took 41.92ms. Allocated memory is still 180.4MB. Free memory was 94.2MB in the beginning and 91.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:48:08,096 INFO L158 Benchmark]: RCFGBuilder took 425.31ms. Allocated memory is still 180.4MB. Free memory was 91.2MB in the beginning and 147.4MB in the end (delta: -56.2MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-20 07:48:08,097 INFO L158 Benchmark]: TraceAbstraction took 2716.35ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 146.6MB in the beginning and 182.3MB in the end (delta: -35.7MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. [2024-11-20 07:48:08,097 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 218.1MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:48:08,098 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.50ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 91.4MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.58ms. Allocated memory is still 180.4MB. Free memory was 111.2MB in the beginning and 96.8MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.42ms. Allocated memory is still 180.4MB. Free memory was 96.8MB in the beginning and 94.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.92ms. Allocated memory is still 180.4MB. Free memory was 94.2MB in the beginning and 91.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.31ms. Allocated memory is still 180.4MB. Free memory was 91.2MB in the beginning and 147.4MB in the end (delta: -56.2MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2716.35ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 146.6MB in the beginning and 182.3MB in the end (delta: -35.7MB). Peak memory consumption was 93.9MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 218.1MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 2; [L31] float var_1_14 = 31.325; [L32] float var_1_15 = 7.4; [L33] float var_1_16 = 7.375; [L34] unsigned short int var_1_17 = 256; [L35] unsigned short int var_1_19 = 24509; [L36] unsigned short int var_1_20 = 32; [L37] unsigned short int var_1_21 = 4; [L38] signed char last_1_var_1_11 = 2; VAL [isInitial=0, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L62] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L64] var_1_5 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L67] var_1_6 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_7 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L71] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L72] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L73] var_1_12 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L74] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L75] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L76] var_1_13 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L77] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L78] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L83] var_1_19 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L84] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L85] CALL assume_abort_if_not(var_1_19 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L85] RET assume_abort_if_not(var_1_19 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L86] var_1_20 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L87] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L88] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L89] var_1_21 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L90] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L91] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L105] RET updateVariables() [L106] CALL step() [L42] COND FALSE !(((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L45] var_1_14 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L46] COND TRUE var_1_14 <= ((var_1_15 - var_1_16) * var_1_14) [L47] var_1_17 = ((var_1_19 - var_1_20) + var_1_21) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L51] COND FALSE !(var_1_17 >= (8u * var_1_17)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L56] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return (((((var_1_17 >= (8u * var_1_17)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed long int) (var_1_17 + var_1_11))) : 1)) && ((((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) ? (var_1_11 == ((signed char) (var_1_12 + var_1_13))) : 1)) && (var_1_14 == ((float) (var_1_15 - var_1_16)))) && ((var_1_14 <= ((var_1_15 - var_1_16) * var_1_14)) ? (var_1_17 == ((unsigned short int) ((var_1_19 - var_1_20) + var_1_21))) : (var_1_17 == ((unsigned short int) var_1_20))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 190 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1366 SizeOfPredicates, 1 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3656/3800 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-20 07:48:08,117 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.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 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:48:10,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:48:10,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:48:10,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:48:10,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:48:10,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:48:10,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:48:10,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:48:10,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:48:10,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:48:10,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:48:10,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:48:10,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:48:10,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:48:10,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:48:10,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:48:10,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:48:10,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:48:10,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:48:10,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:48:10,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:48:10,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:48:10,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:48:10,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:48:10,121 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:48:10,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:48:10,122 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:48:10,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:48:10,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:48:10,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:48:10,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:48:10,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:48:10,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:48:10,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:48:10,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:48:10,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:48:10,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:48:10,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:48:10,125 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:48:10,125 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:48:10,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:48:10,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:48:10,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:48:10,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:48:10,126 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 -> 21c88489aa138dbbc6ea2b63fbc507bc3a819b70c71c9b1f4d3d14d1012d804f [2024-11-20 07:48:10,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:48:10,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:48:10,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:48:10,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:48:10,414 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:48:10,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-20 07:48:11,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:48:11,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:48:11,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-8.i [2024-11-20 07:48:11,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac81ea46/3e5212c22a3443cd9156a7fe30e213d6/FLAG917d94228 [2024-11-20 07:48:12,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ac81ea46/3e5212c22a3443cd9156a7fe30e213d6 [2024-11-20 07:48:12,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:48:12,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:48:12,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:48:12,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:48:12,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:48:12,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76638266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12, skipping insertion in model container [2024-11-20 07:48:12,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:48:12,198 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_operatoramount_amount25_file-8.i[914,927] [2024-11-20 07:48:12,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:48:12,264 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:48:12,276 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_operatoramount_amount25_file-8.i[914,927] [2024-11-20 07:48:12,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:48:12,324 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:48:12,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12 WrapperNode [2024-11-20 07:48:12,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:48:12,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:48:12,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:48:12,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:48:12,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,369 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-20 07:48:12,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:48:12,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:48:12,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:48:12,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:48:12,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,426 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-20 07:48:12,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:48:12,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:48:12,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:48:12,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:48:12,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (1/1) ... [2024-11-20 07:48:12,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:48:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:48:12,484 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-20 07:48:12,486 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-20 07:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:48:12,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:48:12,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:48:12,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:48:12,586 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:48:12,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:48:14,200 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 07:48:14,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:48:14,212 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:48:14,212 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:48:14,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:48:14 BoogieIcfgContainer [2024-11-20 07:48:14,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:48:14,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:48:14,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:48:14,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:48:14,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:48:12" (1/3) ... [2024-11-20 07:48:14,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e0f4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:48:14, skipping insertion in model container [2024-11-20 07:48:14,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:48:12" (2/3) ... [2024-11-20 07:48:14,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56e0f4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:48:14, skipping insertion in model container [2024-11-20 07:48:14,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:48:14" (3/3) ... [2024-11-20 07:48:14,223 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-8.i [2024-11-20 07:48:14,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:48:14,238 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:48:14,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:48:14,293 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;@741a5664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:48:14,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:48:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:14,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:14,308 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:14,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:14,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times [2024-11-20 07:48:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:48:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512877387] [2024-11-20 07:48:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:14,324 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-20 07:48:14,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:48:14,325 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-20 07:48:14,326 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-20 07:48:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:14,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:48:14,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:48:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-20 07:48:14,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:48:14,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:48:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512877387] [2024-11-20 07:48:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512877387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:48:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:48:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:48:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767904858] [2024-11-20 07:48:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:48:14,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:48:14,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:48:14,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:48:14,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:48:14,606 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 07:48:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:48:14,634 INFO L93 Difference]: Finished difference Result 103 states and 176 transitions. [2024-11-20 07:48:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:48:14,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-20 07:48:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:48:14,644 INFO L225 Difference]: With dead ends: 103 [2024-11-20 07:48:14,644 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 07:48:14,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-20 07:48:14,652 INFO L432 NwaCegarLoop]: 74 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, 74 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-20 07:48:14,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:48:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 07:48:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 07:48:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-20 07:48:14,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125 [2024-11-20 07:48:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:48:14,696 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-20 07:48:14,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 07:48:14,697 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-20 07:48:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:14,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:14,699 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:14,708 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-20 07:48:14,900 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-20 07:48:14,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:14,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times [2024-11-20 07:48:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:48:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225899310] [2024-11-20 07:48:14,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:14,902 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-20 07:48:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:48:14,905 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-20 07:48:14,905 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-20 07:48:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:15,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 07:48:15,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:48:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 07:48:15,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:48:15,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:48:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225899310] [2024-11-20 07:48:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225899310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:48:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:48:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:48:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538109558] [2024-11-20 07:48:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:48:15,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 07:48:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:48:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 07:48:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 07:48:15,413 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 07:48:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:48:16,230 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2024-11-20 07:48:16,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:48:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-20 07:48:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:48:16,243 INFO L225 Difference]: With dead ends: 99 [2024-11-20 07:48:16,243 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 07:48:16,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:48:16,244 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 07:48:16,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 07:48:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 07:48:16,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 07:48:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-20 07:48:16,266 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125 [2024-11-20 07:48:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:48:16,268 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-20 07:48:16,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 07:48:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-20 07:48:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:16,271 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:16,280 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 (3)] Ended with exit code 0 [2024-11-20 07:48:16,472 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-20 07:48:16,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:16,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times [2024-11-20 07:48:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:48:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808637215] [2024-11-20 07:48:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:16,477 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-20 07:48:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:48:16,479 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-20 07:48:16,479 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-20 07:48:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:16,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 07:48:16,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:48:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-20 07:48:16,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:48:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 07:48:17,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:48:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808637215] [2024-11-20 07:48:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808637215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:48:17,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:48:17,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-20 07:48:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268680979] [2024-11-20 07:48:17,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:48:17,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:48:17,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:48:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:48:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:48:17,077 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 07:48:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:48:18,341 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-11-20 07:48:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 07:48:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-11-20 07:48:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:48:18,355 INFO L225 Difference]: With dead ends: 107 [2024-11-20 07:48:18,355 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 07:48:18,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:48:18,357 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:48:18,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 07:48:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 07:48:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-20 07:48:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 07:48:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-11-20 07:48:18,367 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125 [2024-11-20 07:48:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:48:18,368 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-11-20 07:48:18,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 07:48:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-11-20 07:48:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 07:48:18,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:48:18,370 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 07:48:18,378 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 (4)] Ended with exit code 0 [2024-11-20 07:48:18,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-20 07:48:18,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:48:18,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:48:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times [2024-11-20 07:48:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:48:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457782307] [2024-11-20 07:48:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:48:18,572 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-20 07:48:18,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:48:18,575 INFO L229 MonitoredProcess]: Starting monitored process 5 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-20 07:48:18,576 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 (5)] Waiting until timeout for monitored process [2024-11-20 07:48:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:48:18,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 07:48:18,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:48:55,854 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-20 07:49:29,082 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)