./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_amount10_file-29.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_amount10_file-29.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 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:26:30,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:26:30,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:26:30,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:26:30,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:26:30,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:26:30,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:26:30,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:26:30,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:26:30,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:26:30,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:26:30,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:26:30,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:26:30,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:26:30,511 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:26:30,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:26:30,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:26:30,512 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:26:30,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:26:30,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:26:30,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:26:30,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:26:30,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:26:30,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:26:30,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:26:30,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:26:30,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:26:30,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:26:30,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:26:30,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:26:30,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:26:30,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:26:30,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:26:30,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:26:30,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:26:30,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:26:30,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:26:30,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:26:30,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:26:30,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:26:30,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:26:30,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:26:30,517 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 -> 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d [2024-11-20 07:26:30,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:26:30,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:26:30,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:26:30,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:26:30,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:26:30,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-11-20 07:26:32,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:26:32,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:26:32,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-11-20 07:26:32,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906f6769c/f653d83f822943c98c8193fbaf9f559b/FLAGd2e081075 [2024-11-20 07:26:32,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906f6769c/f653d83f822943c98c8193fbaf9f559b [2024-11-20 07:26:32,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:26:32,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:26:32,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:26:32,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:26:32,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:26:32,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551a4afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32, skipping insertion in model container [2024-11-20 07:26:32,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:26:32,396 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_amount10_file-29.i[915,928] [2024-11-20 07:26:32,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:26:32,428 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:26:32,438 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_amount10_file-29.i[915,928] [2024-11-20 07:26:32,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:26:32,462 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:26:32,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32 WrapperNode [2024-11-20 07:26:32,464 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:26:32,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:26:32,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:26:32,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:26:32,471 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:26:32" (1/1) ... [2024-11-20 07:26:32,477 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:26:32" (1/1) ... [2024-11-20 07:26:32,498 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-20 07:26:32,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:26:32,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:26:32,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:26:32,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:26:32,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,521 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:26:32,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:26:32,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:26:32,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:26:32,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:26:32,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (1/1) ... [2024-11-20 07:26:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:26:32,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:26:32,570 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:26:32,572 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:26:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:26:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:26:32,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:26:32,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:26:32,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:26:32,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:26:32,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:26:32,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:26:32,832 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 07:26:32,833 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:26:32,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:26:32,842 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:26:32,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:32 BoogieIcfgContainer [2024-11-20 07:26:32,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:26:32,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:26:32,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:26:32,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:26:32,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:26:32" (1/3) ... [2024-11-20 07:26:32,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f1edd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:32, skipping insertion in model container [2024-11-20 07:26:32,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:32" (2/3) ... [2024-11-20 07:26:32,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f1edd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:32, skipping insertion in model container [2024-11-20 07:26:32,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:32" (3/3) ... [2024-11-20 07:26:32,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2024-11-20 07:26:32,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:26:32,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:26:32,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:26:32,931 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;@48db26d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:26:32,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:26:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:26:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 07:26:32,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:32,947 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:32,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:32,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -550549897, now seen corresponding path program 1 times [2024-11-20 07:26:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:26:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977271592] [2024-11-20 07:26:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:26:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:26:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:26:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:26:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:26:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:26:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:26:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:26:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:26:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:26:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:26:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:26:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:26:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:26:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:26:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:26:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:26:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:26:33,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977271592] [2024-11-20 07:26:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977271592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:26:33,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253200999] [2024-11-20 07:26:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:26:33,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:26:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:26:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:26:33,271 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 07:26:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:33,293 INFO L93 Difference]: Finished difference Result 91 states and 152 transitions. [2024-11-20 07:26:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:26:33,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-11-20 07:26:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:33,301 INFO L225 Difference]: With dead ends: 91 [2024-11-20 07:26:33,301 INFO L226 Difference]: Without dead ends: 45 [2024-11-20 07:26:33,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:26:33,305 INFO L432 NwaCegarLoop]: 64 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, 64 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:26:33,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:26:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-20 07:26:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-20 07:26:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:26:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-20 07:26:33,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 100 [2024-11-20 07:26:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:33,338 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-20 07:26:33,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 07:26:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-20 07:26:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 07:26:33,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:33,342 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:26:33,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:33,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash -860864905, now seen corresponding path program 1 times [2024-11-20 07:26:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:26:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997087429] [2024-11-20 07:26:33,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:26:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:26:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:26:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:26:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:26:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:26:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:26:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:26:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:26:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:26:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:26:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:26:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:26:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:26:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:26:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:26:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:26:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:34,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:26:34,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997087429] [2024-11-20 07:26:34,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997087429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:34,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:34,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 07:26:34,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202685908] [2024-11-20 07:26:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:34,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 07:26:34,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:26:34,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 07:26:34,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:26:34,272 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:34,745 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2024-11-20 07:26:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:26:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-11-20 07:26:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:34,748 INFO L225 Difference]: With dead ends: 64 [2024-11-20 07:26:34,749 INFO L226 Difference]: Without dead ends: 62 [2024-11-20 07:26:34,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 07:26:34,751 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:34,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 330 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:26:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-20 07:26:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2024-11-20 07:26:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:26:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2024-11-20 07:26:34,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 100 [2024-11-20 07:26:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:34,773 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2024-11-20 07:26:34,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2024-11-20 07:26:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 07:26:34,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:34,775 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:34,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:26:34,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1071969845, now seen corresponding path program 1 times [2024-11-20 07:26:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:26:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429736077] [2024-11-20 07:26:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:26:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:26:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:26:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:26:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:26:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:26:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:26:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:26:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:26:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:26:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:26:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:26:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:26:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:26:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:26:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:26:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:26:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:26:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429736077] [2024-11-20 07:26:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429736077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 07:26:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031406288] [2024-11-20 07:26:35,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:35,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 07:26:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:26:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 07:26:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:26:35,505 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:35,883 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2024-11-20 07:26:35,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 07:26:35,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-11-20 07:26:35,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:35,887 INFO L225 Difference]: With dead ends: 85 [2024-11-20 07:26:35,887 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 07:26:35,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-20 07:26:35,888 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 39 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:35,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 374 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 07:26:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 07:26:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2024-11-20 07:26:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 48 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:26:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 93 transitions. [2024-11-20 07:26:35,907 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 93 transitions. Word has length 101 [2024-11-20 07:26:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:35,910 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 93 transitions. [2024-11-20 07:26:35,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 93 transitions. [2024-11-20 07:26:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-20 07:26:35,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:35,912 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:35,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:26:35,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:35,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1893577294, now seen corresponding path program 1 times [2024-11-20 07:26:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:26:35,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118235690] [2024-11-20 07:26:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:26:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:26:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:26:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:26:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:26:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:26:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:26:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:26:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:26:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:26:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:26:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:26:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:26:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:26:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:26:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:26:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:26:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:36,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:26:36,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118235690] [2024-11-20 07:26:36,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118235690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:36,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:26:36,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690080351] [2024-11-20 07:26:36,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:36,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:26:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:26:36,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:26:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:26:36,373 INFO L87 Difference]: Start difference. First operand 68 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:36,427 INFO L93 Difference]: Finished difference Result 161 states and 218 transitions. [2024-11-20 07:26:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:26:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-11-20 07:26:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:36,429 INFO L225 Difference]: With dead ends: 161 [2024-11-20 07:26:36,429 INFO L226 Difference]: Without dead ends: 96 [2024-11-20 07:26:36,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:26:36,430 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 31 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:36,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:26:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-20 07:26:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-20 07:26:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 07:26:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-11-20 07:26:36,455 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 101 [2024-11-20 07:26:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-11-20 07:26:36,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-11-20 07:26:36,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 07:26:36,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:36,458 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:26:36,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1184021979, now seen corresponding path program 1 times [2024-11-20 07:26:36,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:26:36,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389619921] [2024-11-20 07:26:36,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:26:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:26:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:26:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:26:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:26:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:26:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:26:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 07:26:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:26:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 07:26:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:26:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 07:26:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 07:26:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 07:26:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 07:26:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 07:26:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 07:26:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:26:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389619921] [2024-11-20 07:26:37,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389619921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:37,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:37,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:26:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124437472] [2024-11-20 07:26:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:26:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:26:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:26:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:26:37,087 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:37,129 INFO L93 Difference]: Finished difference Result 171 states and 228 transitions. [2024-11-20 07:26:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:26:37,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-11-20 07:26:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:37,131 INFO L225 Difference]: With dead ends: 171 [2024-11-20 07:26:37,131 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 07:26:37,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:26:37,133 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:37,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:26:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 07:26:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2024-11-20 07:26:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:26:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2024-11-20 07:26:37,154 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 102 [2024-11-20 07:26:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:37,154 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2024-11-20 07:26:37,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-11-20 07:26:37,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 07:26:37,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:37,156 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:37,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 07:26:37,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:37,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1373297224, now seen corresponding path program 1 times [2024-11-20 07:26:37,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:26:37,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797136574] [2024-11-20 07:26:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:37,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:26:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:26:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1285205207] [2024-11-20 07:26:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:37,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:26:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:26:37,185 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:26:37,187 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:26:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:26:37,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:26:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:26:37,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:26:37,333 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:26:37,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:26:37,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 07:26:37,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 07:26:37,540 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 07:26:37,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:26:37,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:26:37 BoogieIcfgContainer [2024-11-20 07:26:37,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:26:37,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:26:37,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:26:37,607 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:26:37,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:32" (3/4) ... [2024-11-20 07:26:37,609 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:26:37,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:26:37,610 INFO L158 Benchmark]: Toolchain (without parser) took 5384.23ms. Allocated memory was 148.9MB in the beginning and 239.1MB in the end (delta: 90.2MB). Free memory was 91.4MB in the beginning and 178.1MB in the end (delta: -86.7MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-20 07:26:37,610 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:26:37,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.22ms. Allocated memory is still 148.9MB. Free memory was 91.4MB in the beginning and 77.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:26:37,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.83ms. Allocated memory is still 148.9MB. Free memory was 77.8MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:26:37,611 INFO L158 Benchmark]: Boogie Preprocessor took 40.30ms. Allocated memory is still 148.9MB. Free memory was 75.2MB in the beginning and 72.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:26:37,611 INFO L158 Benchmark]: RCFGBuilder took 303.03ms. Allocated memory is still 148.9MB. Free memory was 72.5MB in the beginning and 56.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 07:26:37,611 INFO L158 Benchmark]: TraceAbstraction took 4761.77ms. Allocated memory was 148.9MB in the beginning and 239.1MB in the end (delta: 90.2MB). Free memory was 55.3MB in the beginning and 178.1MB in the end (delta: -122.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:26:37,612 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 239.1MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:26:37,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.22ms. Allocated memory is still 148.9MB. Free memory was 91.4MB in the beginning and 77.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.83ms. Allocated memory is still 148.9MB. Free memory was 77.8MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.30ms. Allocated memory is still 148.9MB. Free memory was 75.2MB in the beginning and 72.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 303.03ms. Allocated memory is still 148.9MB. Free memory was 72.5MB in the beginning and 56.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4761.77ms. Allocated memory was 148.9MB in the beginning and 239.1MB in the end (delta: 90.2MB). Free memory was 55.3MB in the beginning and 178.1MB in the end (delta: -122.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 239.1MB. Free memory is still 178.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 32; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 4; [L28] unsigned char var_1_7 = 16; [L29] unsigned char var_1_8 = 10; VAL [isInitial=0, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L75] isInitial = 1 [L76] FCALL initially() [L77] COND TRUE 1 [L78] FCALL updateLastVariables() [L79] CALL updateVariables() [L44] var_1_2 = __VERIFIER_nondet_uchar() [L45] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L45] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L46] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L46] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_3=128, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L47] var_1_3 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L48] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L49] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L49] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=32, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L50] var_1_4 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L51] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L52] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L52] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L53] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L53] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=0, var_1_6=4, var_1_7=16, var_1_8=10] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=4, var_1_7=16, var_1_8=10] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L60] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L60] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=16, var_1_8=10] [L61] var_1_7 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_8=10] [L62] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_8=10] [L63] CALL assume_abort_if_not(var_1_7 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=10] [L63] RET assume_abort_if_not(var_1_7 <= 32) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=10] [L64] var_1_8 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1] [L65] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1] [L66] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L66] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L79] RET updateVariables() [L80] CALL step() [L33] EXPR (var_1_5 / var_1_6) >> var_1_7 VAL [isInitial=1, var_1_1=0, var_1_2=0, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L33] COND TRUE (var_1_3 / var_1_4) >= ((var_1_5 / var_1_6) >> var_1_7) [L34] var_1_1 = ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=-255, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L80] RET step() [L81] CALL, EXPR property() [L71] EXPR (var_1_5 / var_1_6) >> var_1_7 VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=-255, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L71-L72] return ((var_1_3 / var_1_4) >= ((var_1_5 / var_1_6) >> var_1_7)) ? (var_1_1 == ((unsigned char) ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_2 ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) ; [L81] RET, EXPR property() [L81] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=-255, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] [L19] reach_error() VAL [isInitial=1, var_1_1=1, var_1_2=0, var_1_3=-255, var_1_4=2, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=-254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 358 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 35 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 1687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2400/2400 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:26:37,637 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_amount10_file-29.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 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:26:39,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:26:39,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:26:39,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:26:39,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:26:39,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:26:39,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:26:39,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:26:39,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:26:39,562 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:26:39,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:26:39,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:26:39,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:26:39,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:26:39,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:26:39,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:26:39,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:26:39,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:26:39,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:26:39,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:26:39,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:26:39,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:26:39,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:26:39,566 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:26:39,567 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:26:39,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:26:39,567 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:26:39,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:26:39,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:26:39,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:26:39,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:26:39,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:26:39,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:26:39,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:26:39,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:26:39,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:26:39,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:26:39,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:26:39,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:26:39,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:26:39,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:26:39,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:26:39,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:26:39,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:26:39,572 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 -> 7e3b862ba9a2a4c1c92e3db12119deeccd82c1339b8fd16f8352680fc1302c9d [2024-11-20 07:26:39,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:26:39,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:26:39,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:26:39,868 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:26:39,869 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:26:39,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-11-20 07:26:41,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:26:41,355 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:26:41,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-29.i [2024-11-20 07:26:41,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f646d172/88f169af5fbe4ff2ae3a72b22dde0ad4/FLAG2c2911134 [2024-11-20 07:26:41,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f646d172/88f169af5fbe4ff2ae3a72b22dde0ad4 [2024-11-20 07:26:41,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:26:41,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:26:41,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:26:41,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:26:41,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:26:41,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e08286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41, skipping insertion in model container [2024-11-20 07:26:41,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:26:41,537 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_amount10_file-29.i[915,928] [2024-11-20 07:26:41,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:26:41,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:26:41,590 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_amount10_file-29.i[915,928] [2024-11-20 07:26:41,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:26:41,627 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:26:41,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41 WrapperNode [2024-11-20 07:26:41,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:26:41,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:26:41,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:26:41,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:26:41,634 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:26:41" (1/1) ... [2024-11-20 07:26:41,644 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:26:41" (1/1) ... [2024-11-20 07:26:41,667 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-20 07:26:41,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:26:41,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:26:41,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:26:41,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:26:41,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,696 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:26:41,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:26:41,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:26:41,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:26:41,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:26:41,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (1/1) ... [2024-11-20 07:26:41,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:26:41,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:26:41,751 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:26:41,753 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:26:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:26:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:26:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:26:41,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:26:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:26:41,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:26:41,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:26:41,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:26:42,081 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 07:26:42,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:26:42,095 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:26:42,095 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:26:42,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:42 BoogieIcfgContainer [2024-11-20 07:26:42,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:26:42,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:26:42,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:26:42,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:26:42,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:26:41" (1/3) ... [2024-11-20 07:26:42,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdc3a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:42, skipping insertion in model container [2024-11-20 07:26:42,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:26:41" (2/3) ... [2024-11-20 07:26:42,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdc3a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:26:42, skipping insertion in model container [2024-11-20 07:26:42,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:42" (3/3) ... [2024-11-20 07:26:42,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-29.i [2024-11-20 07:26:42,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:26:42,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:26:42,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:26:42,170 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;@1bba6ac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:26:42,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:26:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:26:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 07:26:42,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:42,181 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:42,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash 229598373, now seen corresponding path program 1 times [2024-11-20 07:26:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:26:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449908352] [2024-11-20 07:26:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:42,201 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:26:42,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:26:42,203 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:26:42,204 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:26:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:42,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:26:42,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-20 07:26:42,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:26:42,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:26:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449908352] [2024-11-20 07:26:42,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449908352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:42,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:42,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:26:42,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615475321] [2024-11-20 07:26:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:42,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:26:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:26:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:26:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:26:42,434 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 07:26:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:42,457 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2024-11-20 07:26:42,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:26:42,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 97 [2024-11-20 07:26:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:42,465 INFO L225 Difference]: With dead ends: 81 [2024-11-20 07:26:42,465 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 07:26:42,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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:26:42,472 INFO L432 NwaCegarLoop]: 57 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, 57 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:26:42,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:26:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 07:26:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-20 07:26:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 07:26:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2024-11-20 07:26:42,506 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 97 [2024-11-20 07:26:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:42,506 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2024-11-20 07:26:42,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 07:26:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2024-11-20 07:26:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 07:26:42,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:42,510 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:42,517 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:26:42,711 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:26:42,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:42,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1601082203, now seen corresponding path program 1 times [2024-11-20 07:26:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:26:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61927534] [2024-11-20 07:26:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:42,713 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:26:42,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:26:42,715 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:26:42,717 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:26:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:42,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 07:26:42,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:44,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:26:44,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:26:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61927534] [2024-11-20 07:26:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61927534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:44,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:26:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577090335] [2024-11-20 07:26:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:44,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:26:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:26:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:26:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:26:44,102 INFO L87 Difference]: Start difference. First operand 40 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:45,282 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-20 07:26:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 07:26:45,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2024-11-20 07:26:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:45,289 INFO L225 Difference]: With dead ends: 55 [2024-11-20 07:26:45,289 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 07:26:45,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 07:26:45,291 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 13 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:45,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 07:26:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 07:26:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-20 07:26:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 07:26:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2024-11-20 07:26:45,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 97 [2024-11-20 07:26:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:45,309 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2024-11-20 07:26:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2024-11-20 07:26:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 07:26:45,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:26:45,312 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:26:45,323 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:26:45,513 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:26:45,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:26:45,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:26:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1961408050, now seen corresponding path program 1 times [2024-11-20 07:26:45,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:26:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686793077] [2024-11-20 07:26:45,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:26:45,515 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:26:45,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:26:45,517 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:26:45,518 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:26:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:26:45,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 07:26:45,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:26:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 07:26:46,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:26:46,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:26:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686793077] [2024-11-20 07:26:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686793077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:26:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:26:46,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:26:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134417019] [2024-11-20 07:26:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:26:46,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:26:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:26:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:26:46,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:26:46,657 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:26:47,581 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-11-20 07:26:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:26:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-11-20 07:26:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:26:47,588 INFO L225 Difference]: With dead ends: 61 [2024-11-20 07:26:47,588 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 07:26:47,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:26:47,589 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 07:26:47,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 224 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 07:26:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 07:26:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 07:26:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 07:26:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 07:26:47,591 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-11-20 07:26:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:26:47,592 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 07:26:47,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 07:26:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 07:26:47,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 07:26:47,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:26:47,600 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:26:47,794 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:26:47,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 07:26:47,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 07:26:48,070 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:26:48,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:26:48 BoogieIcfgContainer [2024-11-20 07:26:48,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:26:48,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:26:48,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:26:48,093 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:26:48,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:26:42" (3/4) ... [2024-11-20 07:26:48,095 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 07:26:48,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 07:26:48,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-20 07:26:48,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 07:26:48,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 07:26:48,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 07:26:48,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 07:26:48,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 07:26:48,201 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:26:48,202 INFO L158 Benchmark]: Toolchain (without parser) took 6825.79ms. Allocated memory was 69.2MB in the beginning and 136.3MB in the end (delta: 67.1MB). Free memory was 45.4MB in the beginning and 107.1MB in the end (delta: -61.6MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,202 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 69.2MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:26:48,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.62ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 74.1MB in the end (delta: -28.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 94.4MB. Free memory was 74.1MB in the beginning and 72.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,203 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 94.4MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,203 INFO L158 Benchmark]: RCFGBuilder took 375.91ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 57.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,204 INFO L158 Benchmark]: TraceAbstraction took 5995.38ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 113.3MB in the end (delta: -57.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,204 INFO L158 Benchmark]: Witness Printer took 108.16ms. Allocated memory is still 136.3MB. Free memory was 113.3MB in the beginning and 107.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 07:26:48,205 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 69.2MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.62ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 45.3MB in the beginning and 74.1MB in the end (delta: -28.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 94.4MB. Free memory was 74.1MB in the beginning and 72.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 94.4MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.91ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 57.0MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5995.38ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 113.3MB in the end (delta: -57.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 108.16ms. Allocated memory is still 136.3MB. Free memory was 113.3MB in the beginning and 107.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 187 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 289 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 14 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1440/1440 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-20 07:26:48,228 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 Writing output log to file Ultimate.log Result: TRUE