./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-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-14.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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:25:54,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:25:54,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:25:54,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:25:54,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:25:55,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:25:55,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:25:55,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:25:55,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:25:55,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:25:55,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:25:55,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:25:55,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:25:55,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:25:55,026 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:25:55,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:25:55,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:25:55,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:25:55,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:25:55,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:25:55,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:25:55,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:25:55,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:25:55,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:25:55,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:25:55,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:25:55,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:25:55,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:25:55,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:25:55,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:25:55,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:25:55,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:25:55,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:25:55,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:25:55,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:25:55,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:25:55,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:25:55,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:25:55,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:25:55,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:25:55,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:25:55,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:25:55,042 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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2024-10-14 12:25:55,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:25:55,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:25:55,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:25:55,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:25:55,381 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:25:55,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2024-10-14 12:25:56,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:25:57,156 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:25:57,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2024-10-14 12:25:57,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edb912bc/4a945bab579c4bf88c8d5684e74e06c8/FLAG2a7eeb4cc [2024-10-14 12:25:57,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edb912bc/4a945bab579c4bf88c8d5684e74e06c8 [2024-10-14 12:25:57,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:25:57,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:25:57,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:25:57,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:25:57,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:25:57,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adb5a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57, skipping insertion in model container [2024-10-14 12:25:57,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:25:57,410 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-10-14 12:25:57,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:25:57,472 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:25:57,484 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-10-14 12:25:57,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:25:57,532 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:25:57,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57 WrapperNode [2024-10-14 12:25:57,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:25:57,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:25:57,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:25:57,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:25:57,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,583 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2024-10-14 12:25:57,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:25:57,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:25:57,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:25:57,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:25:57,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:25:57,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:25:57,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:25:57,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:25:57,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:25:57,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (1/1) ... [2024-10-14 12:25:57,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:25:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:25:57,695 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-10-14 12:25:57,700 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-10-14 12:25:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:25:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:25:57,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:25:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:25:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:25:57,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:25:57,847 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:25:57,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:25:58,013 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 12:25:58,013 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:25:58,053 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:25:58,053 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:25:58,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:25:58 BoogieIcfgContainer [2024-10-14 12:25:58,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:25:58,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:25:58,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:25:58,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:25:58,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:25:57" (1/3) ... [2024-10-14 12:25:58,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3805820f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:25:58, skipping insertion in model container [2024-10-14 12:25:58,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:57" (2/3) ... [2024-10-14 12:25:58,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3805820f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:25:58, skipping insertion in model container [2024-10-14 12:25:58,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:25:58" (3/3) ... [2024-10-14 12:25:58,065 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2024-10-14 12:25:58,085 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:25:58,085 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:25:58,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:25:58,152 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;@6ad71529, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:25:58,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:25:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 12:25:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 12:25:58,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:58,165 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:25:58,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:58,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2001514219, now seen corresponding path program 1 times [2024-10-14 12:25:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:25:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020122663] [2024-10-14 12:25:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:25:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:25:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:25:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:25:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 12:25:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:25:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 12:25:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:25:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 12:25:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:25:58,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020122663] [2024-10-14 12:25:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020122663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:25:58,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:25:58,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:25:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558124984] [2024-10-14 12:25:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:25:58,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:25:58,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:25:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:25:58,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:25:58,582 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 12:25:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:58,632 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2024-10-14 12:25:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:25:58,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-10-14 12:25:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:58,644 INFO L225 Difference]: With dead ends: 49 [2024-10-14 12:25:58,644 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 12:25:58,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:25:58,656 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:58,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:25:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 12:25:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 12:25:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 12:25:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 12:25:58,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 46 [2024-10-14 12:25:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:58,707 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 12:25:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 12:25:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 12:25:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 12:25:58,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:58,711 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:25:58,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:25:58,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:58,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1049244849, now seen corresponding path program 1 times [2024-10-14 12:25:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:25:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786068365] [2024-10-14 12:25:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:25:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:25:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:25:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:58,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:25:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:59,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 12:25:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:59,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:25:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 12:25:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:59,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:25:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 12:25:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:25:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786068365] [2024-10-14 12:25:59,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786068365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:25:59,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:25:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:25:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327108060] [2024-10-14 12:25:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:25:59,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:25:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:25:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:25:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:25:59,043 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 12:25:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:59,074 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-14 12:25:59,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:25:59,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2024-10-14 12:25:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:59,080 INFO L225 Difference]: With dead ends: 47 [2024-10-14 12:25:59,080 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 12:25:59,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-10-14 12:25:59,083 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:59,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:25:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 12:25:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 12:25:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 12:25:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-14 12:25:59,092 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 46 [2024-10-14 12:25:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:59,094 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-14 12:25:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 12:25:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-14 12:25:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 12:25:59,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:59,096 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:25:59,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:25:59,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:59,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:59,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1049304431, now seen corresponding path program 1 times [2024-10-14 12:25:59,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:25:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413881948] [2024-10-14 12:25:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:59,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:25:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:25:59,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:25:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:25:59,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:25:59,325 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:25:59,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:25:59,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:25:59,341 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 12:25:59,388 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:25:59,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:25:59 BoogieIcfgContainer [2024-10-14 12:25:59,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:25:59,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:25:59,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:25:59,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:25:59,398 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:25:58" (3/4) ... [2024-10-14 12:25:59,401 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:25:59,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:25:59,403 INFO L158 Benchmark]: Toolchain (without parser) took 2216.61ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 78.5MB in the beginning and 152.0MB in the end (delta: -73.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:25:59,403 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 148.9MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:25:59,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.62ms. Allocated memory is still 148.9MB. Free memory was 78.3MB in the beginning and 66.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 12:25:59,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.42ms. Allocated memory is still 148.9MB. Free memory was 66.3MB in the beginning and 64.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:25:59,408 INFO L158 Benchmark]: Boogie Preprocessor took 59.59ms. Allocated memory is still 148.9MB. Free memory was 64.6MB in the beginning and 62.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 12:25:59,411 INFO L158 Benchmark]: RCFGBuilder took 409.11ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 62.5MB in the beginning and 153.5MB in the end (delta: -91.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-14 12:25:59,412 INFO L158 Benchmark]: TraceAbstraction took 1338.64ms. Allocated memory is still 188.7MB. Free memory was 152.4MB in the beginning and 152.0MB in the end (delta: 404.3kB). Peak memory consumption was 399.1kB. Max. memory is 16.1GB. [2024-10-14 12:25:59,412 INFO L158 Benchmark]: Witness Printer took 6.24ms. Allocated memory is still 188.7MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:25:59,415 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.20ms. Allocated memory is still 148.9MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.62ms. Allocated memory is still 148.9MB. Free memory was 78.3MB in the beginning and 66.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.42ms. Allocated memory is still 148.9MB. Free memory was 66.3MB in the beginning and 64.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.59ms. Allocated memory is still 148.9MB. Free memory was 64.6MB in the beginning and 62.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.11ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 62.5MB in the beginning and 153.5MB in the end (delta: -91.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1338.64ms. Allocated memory is still 188.7MB. Free memory was 152.4MB in the beginning and 152.0MB in the end (delta: 404.3kB). Peak memory consumption was 399.1kB. Max. memory is 16.1GB. * Witness Printer took 6.24ms. Allocated memory is still 188.7MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.75; [L23] double var_1_5 = 2.05; [L24] double var_1_6 = 9.375; [L25] double var_1_7 = 64.4; [L26] double var_1_8 = 10000.25; [L27] signed short int var_1_9 = -2; [L28] signed short int var_1_10 = 0; [L29] unsigned short int var_1_11 = 4; [L30] unsigned short int var_1_12 = 128; [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L43] var_1_5 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L44] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_6=75/8, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L45] var_1_6 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L46] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_7=322/5, var_1_8=40001/4, var_1_9=-2] [L47] var_1_7 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L48] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L49] var_1_10 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L50] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L51] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_12=128, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L52] var_1_12 = __VERIFIER_nondet_ushort() [L53] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L53] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=50, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L54] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=50, var_1_11=4, var_1_12=65534, var_1_1=67/4, var_1_8=40001/4, var_1_9=-2] [L67] RET updateVariables() [L68] CALL step() [L34] var_1_8 = var_1_5 [L35] var_1_9 = var_1_10 [L36] var_1_11 = var_1_12 [L37] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=50, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_1=67/4, var_1_5=65539, var_1_8=65539, var_1_9=50] [L38] COND TRUE stepLocal_0 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9)))) [L39] var_1_1 = ((var_1_5 + var_1_6) + var_1_7) VAL [isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return ((((var_1_9 <= (var_1_11 + ((((50) > (var_1_9)) ? (50) : (var_1_9))))) ? (var_1_1 == ((double) ((var_1_5 + var_1_6) + var_1_7))) : 1) && (var_1_8 == ((double) var_1_5))) && (var_1_9 == ((signed short int) var_1_10))) && (var_1_11 == ((unsigned short int) var_1_12)) ; [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] [L19] reach_error() VAL [isInitial=1, var_1_10=50, var_1_11=65534, var_1_12=65534, var_1_5=65539, var_1_8=65539, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 54 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 168/168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 12:25:59,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-14.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 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:26:01,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:26:02,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:26:02,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:26:02,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:26:02,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:26:02,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:26:02,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:26:02,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:26:02,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:26:02,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:26:02,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:26:02,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:26:02,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:26:02,138 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:26:02,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:26:02,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:26:02,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:26:02,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:26:02,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:26:02,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:26:02,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:26:02,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:26:02,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:26:02,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:26:02,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:26:02,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:26:02,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:26:02,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:26:02,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:26:02,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:26:02,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:26:02,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:26:02,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:26:02,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:26:02,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:26:02,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:26:02,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:26:02,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:26:02,150 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:26:02,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:26:02,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:26:02,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:26:02,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:26:02,152 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:26:02,152 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 -> 0cb882cfd69f05f54da892fd87d6e6d21910f2af522148b65b2b913f00b9dfcc [2024-10-14 12:26:02,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:26:02,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:26:02,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:26:02,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:26:02,596 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:26:02,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2024-10-14 12:26:04,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:26:04,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:26:04,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i [2024-10-14 12:26:04,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387ae032e/d5ebaf493fd5468f90de0af394d6e7eb/FLAG8970f2e26 [2024-10-14 12:26:04,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/387ae032e/d5ebaf493fd5468f90de0af394d6e7eb [2024-10-14 12:26:04,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:26:04,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:26:04,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:26:04,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:26:04,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:26:04,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d8a4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04, skipping insertion in model container [2024-10-14 12:26:04,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:26:04,718 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-10-14 12:26:04,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:26:04,788 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:26:04,802 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-14.i[915,928] [2024-10-14 12:26:04,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:26:04,840 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:26:04,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04 WrapperNode [2024-10-14 12:26:04,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:26:04,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:26:04,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:26:04,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:26:04,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,898 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2024-10-14 12:26:04,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:26:04,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:26:04,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:26:04,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:26:04,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:26:04,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:26:04,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:26:04,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:26:04,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:26:04,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (1/1) ... [2024-10-14 12:26:04,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:26:04,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:26:05,012 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-10-14 12:26:05,016 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-10-14 12:26:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:26:05,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:26:05,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:26:05,069 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:26:05,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:26:05,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:26:05,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:26:05,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:26:07,304 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 12:26:07,304 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:26:07,355 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:26:07,355 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:26:07,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:26:07 BoogieIcfgContainer [2024-10-14 12:26:07,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:26:07,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:26:07,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:26:07,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:26:07,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:26:04" (1/3) ... [2024-10-14 12:26:07,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be08420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:26:07, skipping insertion in model container [2024-10-14 12:26:07,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:26:04" (2/3) ... [2024-10-14 12:26:07,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be08420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:26:07, skipping insertion in model container [2024-10-14 12:26:07,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:26:07" (3/3) ... [2024-10-14 12:26:07,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-14.i [2024-10-14 12:26:07,388 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:26:07,388 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:26:07,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:26:07,479 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;@1ae2c431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:26:07,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:26:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 12:26:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 12:26:07,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:26:07,493 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:26:07,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:26:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:26:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2001514219, now seen corresponding path program 1 times [2024-10-14 12:26:07,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:26:07,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942764205] [2024-10-14 12:26:07,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:26:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:26:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:26:07,519 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-10-14 12:26:07,521 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-10-14 12:26:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:26:07,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:26:07,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:26:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 12:26:07,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:26:07,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:26:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942764205] [2024-10-14 12:26:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942764205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:26:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:26:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:26:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223988181] [2024-10-14 12:26:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:26:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:26:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:26:07,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:26:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:26:07,860 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 12:26:09,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:26:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:26:09,052 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2024-10-14 12:26:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:26:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-10-14 12:26:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:26:09,077 INFO L225 Difference]: With dead ends: 49 [2024-10-14 12:26:09,077 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 12:26:09,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:26:09,083 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:26:09,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 12:26:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 12:26:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 12:26:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 12:26:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-14 12:26:09,121 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 46 [2024-10-14 12:26:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:26:09,121 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-14 12:26:09,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 12:26:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-14 12:26:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 12:26:09,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:26:09,125 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:26:09,134 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-10-14 12:26:09,327 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-10-14 12:26:09,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:26:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:26:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1049244849, now seen corresponding path program 1 times [2024-10-14 12:26:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:26:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524276047] [2024-10-14 12:26:09,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:26:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:26:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:26:09,334 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-10-14 12:26:09,336 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-10-14 12:26:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:26:09,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 12:26:09,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:26:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 12:26:09,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:26:09,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:26:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524276047] [2024-10-14 12:26:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524276047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:26:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:26:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:26:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826069831] [2024-10-14 12:26:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:26:09,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:26:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:26:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:26:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:26:09,650 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 12:26:11,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:26:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:26:11,712 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-14 12:26:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:26:11,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 46 [2024-10-14 12:26:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:26:11,732 INFO L225 Difference]: With dead ends: 47 [2024-10-14 12:26:11,733 INFO L226 Difference]: Without dead ends: 24 [2024-10-14 12:26:11,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-10-14 12:26:11,735 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:26:11,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 12:26:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-14 12:26:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-14 12:26:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 12:26:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-14 12:26:11,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 46 [2024-10-14 12:26:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:26:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-14 12:26:11,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 12:26:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-14 12:26:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 12:26:11,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:26:11,752 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:26:11,765 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-10-14 12:26:11,952 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-10-14 12:26:11,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:26:11,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:26:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1049304431, now seen corresponding path program 1 times [2024-10-14 12:26:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:26:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409987305] [2024-10-14 12:26:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:26:11,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 12:26:11,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:26:11,957 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-10-14 12:26:11,959 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-10-14 12:26:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:26:12,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 12:26:12,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:27:12,338 WARN L286 SmtUtils]: Spent 18.44s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 12:27:20,600 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)