./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.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 b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:38:58,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:38:58,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:38:58,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:38:58,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:38:58,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:38:58,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:38:58,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:38:58,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:38:58,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:38:58,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:38:58,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:38:58,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:38:58,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:38:58,377 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:38:58,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:38:58,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:38:58,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:38:58,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:38:58,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:38:58,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:38:58,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:38:58,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:38:58,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:38:58,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:38:58,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:38:58,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:38:58,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:38:58,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:38:58,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:38:58,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:38:58,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:38:58,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:38:58,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:38:58,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:38:58,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:38:58,382 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 -> b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 [2024-10-24 10:38:58,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:38:58,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:38:58,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:38:58,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:38:58,609 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:38:58,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2024-10-24 10:38:59,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:39:00,101 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:39:00,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2024-10-24 10:39:00,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbded348/4cd2f85660394b0895bd9606424181e2/FLAG041491e17 [2024-10-24 10:39:00,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbded348/4cd2f85660394b0895bd9606424181e2 [2024-10-24 10:39:00,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:39:00,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:39:00,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:00,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:39:00,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:39:00,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371195b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00, skipping insertion in model container [2024-10-24 10:39:00,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:39:00,345 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_amount25_file-75.i[915,928] [2024-10-24 10:39:00,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:00,398 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:39:00,408 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_amount25_file-75.i[915,928] [2024-10-24 10:39:00,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:00,449 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:39:00,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00 WrapperNode [2024-10-24 10:39:00,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:00,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:00,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:39:00,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:39:00,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,506 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 10:39:00,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:00,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:39:00,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:39:00,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:39:00,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,559 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-24 10:39:00,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:39:00,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:39:00,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:39:00,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:39:00,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (1/1) ... [2024-10-24 10:39:00,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:00,649 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-24 10:39:00,651 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-24 10:39:00,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:39:00,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:39:00,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:39:00,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:39:00,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:39:00,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:39:00,765 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:39:00,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:39:01,007 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 10:39:01,007 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:39:01,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:39:01,043 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:39:01,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:01 BoogieIcfgContainer [2024-10-24 10:39:01,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:39:01,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:39:01,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:39:01,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:39:01,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:00" (1/3) ... [2024-10-24 10:39:01,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d34846c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:01, skipping insertion in model container [2024-10-24 10:39:01,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:00" (2/3) ... [2024-10-24 10:39:01,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d34846c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:01, skipping insertion in model container [2024-10-24 10:39:01,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:01" (3/3) ... [2024-10-24 10:39:01,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-75.i [2024-10-24 10:39:01,068 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:39:01,069 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:39:01,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:39:01,146 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;@3819a80e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:39:01,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:39:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:39:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:39:01,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:01,164 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:39:01,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:01,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash 452644599, now seen corresponding path program 1 times [2024-10-24 10:39:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736592065] [2024-10-24 10:39:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:01,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:39:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:39:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:39:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:39:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:39:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:39:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:39:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:39:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 10:39:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 10:39:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 10:39:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:39:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736592065] [2024-10-24 10:39:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736592065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:39:01,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388788640] [2024-10-24 10:39:01,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:39:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:01,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:39:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:39:01,505 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:39:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:01,545 INFO L93 Difference]: Finished difference Result 77 states and 130 transitions. [2024-10-24 10:39:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:39:01,549 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-24 10:39:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:01,556 INFO L225 Difference]: With dead ends: 77 [2024-10-24 10:39:01,557 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 10:39:01,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-24 10:39:01,564 INFO L432 NwaCegarLoop]: 51 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, 51 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-24 10:39:01,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:39:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 10:39:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 10:39:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:39:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-24 10:39:01,608 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 88 [2024-10-24 10:39:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:01,608 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-24 10:39:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:39:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-24 10:39:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:39:01,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:01,612 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:39:01,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:39:01,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash 469163327, now seen corresponding path program 1 times [2024-10-24 10:39:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673406722] [2024-10-24 10:39:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:39:01,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879540221] [2024-10-24 10:39:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:01,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:39:01,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:01,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:39:01,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:39:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:01,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 10:39:01,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:39:02,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:39:02,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:02,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673406722] [2024-10-24 10:39:02,087 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 10:39:02,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879540221] [2024-10-24 10:39:02,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879540221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:02,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:02,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:39:02,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865340852] [2024-10-24 10:39:02,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:39:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:02,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:39:02,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:02,092 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:39:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:02,226 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2024-10-24 10:39:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:39:02,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-24 10:39:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:02,230 INFO L225 Difference]: With dead ends: 113 [2024-10-24 10:39:02,230 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 10:39:02,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:39:02,233 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:02,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 166 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 10:39:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2024-10-24 10:39:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:39:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-10-24 10:39:02,253 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 88 [2024-10-24 10:39:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:02,254 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-10-24 10:39:02,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:39:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-10-24 10:39:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:39:02,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:02,258 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:39:02,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 10:39:02,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:39:02,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:02,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2050796607, now seen corresponding path program 1 times [2024-10-24 10:39:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477685047] [2024-10-24 10:39:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:39:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651472075] [2024-10-24 10:39:02,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:02,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:39:02,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:02,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:39:02,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 10:39:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:39:02,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:39:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:39:02,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:39:02,692 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:39:02,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:39:02,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:39:02,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-24 10:39:02,904 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:39:02,970 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:39:02,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:39:02 BoogieIcfgContainer [2024-10-24 10:39:02,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:39:02,977 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:39:02,977 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:39:02,977 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:39:02,978 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:01" (3/4) ... [2024-10-24 10:39:02,980 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:39:02,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:39:02,982 INFO L158 Benchmark]: Toolchain (without parser) took 2852.45ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 72.4MB in the end (delta: 13.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:02,983 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:02,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.46ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 71.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:39:02,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.31ms. Allocated memory is still 155.2MB. Free memory was 71.4MB in the beginning and 68.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:02,984 INFO L158 Benchmark]: Boogie Preprocessor took 90.48ms. Allocated memory is still 155.2MB. Free memory was 67.7MB in the beginning and 124.5MB in the end (delta: -56.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-10-24 10:39:02,984 INFO L158 Benchmark]: RCFGBuilder took 445.72ms. Allocated memory is still 155.2MB. Free memory was 124.5MB in the beginning and 103.9MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 10:39:02,984 INFO L158 Benchmark]: TraceAbstraction took 1928.04ms. Allocated memory is still 155.2MB. Free memory was 103.4MB in the beginning and 72.4MB in the end (delta: 31.0MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:02,985 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 155.2MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:02,986 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.13ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.46ms. Allocated memory is still 155.2MB. Free memory was 86.2MB in the beginning and 71.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.31ms. Allocated memory is still 155.2MB. Free memory was 71.4MB in the beginning and 68.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.48ms. Allocated memory is still 155.2MB. Free memory was 67.7MB in the beginning and 124.5MB in the end (delta: -56.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * RCFGBuilder took 445.72ms. Allocated memory is still 155.2MB. Free memory was 124.5MB in the beginning and 103.9MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1928.04ms. Allocated memory is still 155.2MB. Free memory was 103.4MB in the beginning and 72.4MB in the end (delta: 31.0MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 155.2MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_7 = 128; [L24] unsigned char var_1_8 = 64; [L25] unsigned char var_1_9 = 100; [L26] unsigned char var_1_10 = 1; [L27] float var_1_11 = -0.6; [L28] unsigned char var_1_12 = 1; [L29] double var_1_13 = 999999999999999.2; [L30] float var_1_14 = 50.25; [L31] float var_1_15 = 15.5; [L32] float var_1_16 = 128.5; [L33] unsigned char var_1_17 = 0; [L34] unsigned char last_1_var_1_17 = 0; [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] CALL updateLastVariables() [L82] last_1_var_1_17 = var_1_17 [L92] RET updateLastVariables() [L93] CALL updateVariables() [L57] var_1_7 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=64, var_1_9=100] [L58] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=64, var_1_9=100] [L59] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=64, var_1_9=100] [L59] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=64, var_1_9=100] [L60] var_1_8 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=100] [L61] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=100] [L62] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=100] [L62] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=100] [L63] var_1_9 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L64] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L65] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L65] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L66] var_1_10 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L67] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L68] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L69] var_1_12 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L70] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L71] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L72] var_1_13 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L73] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L74] var_1_14 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L75] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L76] var_1_15 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L77] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L78] var_1_16 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L79] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L93] RET updateVariables() [L94] CALL step() [L38] signed long int stepLocal_0 = (last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_0=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=766, var_1_8=63, var_1_9=127] [L39] COND FALSE !(stepLocal_0 < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) [L42] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=766, var_1_8=63, var_1_9=127] [L44] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_1=63, var_1_10=63, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=766, var_1_8=63, var_1_9=127] [L45] COND TRUE stepLocal_1 >= var_1_1 [L46] var_1_17 = (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_12=0, var_1_17=127, var_1_1=63, var_1_7=766, var_1_8=63, var_1_9=127] [L50] COND TRUE var_1_12 || ((var_1_13 * 49.25) == 32.8) [L51] var_1_11 = (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=127, var_1_1=63, var_1_7=766, var_1_8=63, var_1_9=127] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return (((((last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17) < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_1 == ((unsigned char) (var_1_7 - (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)))) : (var_1_1 == ((unsigned char) var_1_8))) && ((var_1_12 || ((var_1_13 * 49.25) == 32.8)) ? (var_1_11 == ((float) (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))))) : (var_1_11 == ((float) var_1_15)))) && ((var_1_1 >= var_1_1) ? (var_1_17 == ((unsigned char) (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))))) : (var_1_17 == ((unsigned char) var_1_8))) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=127, var_1_1=63, var_1_7=766, var_1_8=63, var_1_9=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=0, var_1_10=63, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=127, var_1_1=63, var_1_7=766, var_1_8=63, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 100 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 1 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 728/728 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-24 10:39:03,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.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 b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:39:05,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:39:05,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:39:05,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:39:05,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:39:05,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:39:05,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:39:05,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:39:05,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:39:05,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:39:05,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:39:05,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:39:05,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:39:05,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:39:05,219 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:39:05,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:39:05,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:39:05,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:39:05,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:39:05,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:39:05,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:39:05,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:39:05,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:39:05,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:39:05,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:39:05,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:39:05,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:39:05,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:39:05,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:05,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:39:05,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:39:05,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:39:05,228 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:39:05,228 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:39:05,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:39:05,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:39:05,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:39:05,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:39:05,231 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:39:05,231 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 -> b3d91d8f93f332a0b991591fdb7699a2f5039db379a8bbd5ad480afa85a9a3c7 [2024-10-24 10:39:05,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:39:05,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:39:05,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:39:05,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:39:05,556 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:39:05,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2024-10-24 10:39:06,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:39:07,171 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:39:07,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-75.i [2024-10-24 10:39:07,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780478de7/e9c92161e9704a1ab1172808b5314abc/FLAGab58a53d7 [2024-10-24 10:39:07,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/780478de7/e9c92161e9704a1ab1172808b5314abc [2024-10-24 10:39:07,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:39:07,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:39:07,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:07,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:39:07,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:39:07,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5bf213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07, skipping insertion in model container [2024-10-24 10:39:07,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:39:07,390 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_amount25_file-75.i[915,928] [2024-10-24 10:39:07,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:07,450 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:39:07,461 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_amount25_file-75.i[915,928] [2024-10-24 10:39:07,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:07,501 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:39:07,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07 WrapperNode [2024-10-24 10:39:07,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:07,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:07,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:39:07,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:39:07,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,550 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 10:39:07,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:07,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:39:07,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:39:07,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:39:07,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,581 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-24 10:39:07,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:39:07,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:39:07,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:39:07,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:39:07,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (1/1) ... [2024-10-24 10:39:07,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:07,638 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-24 10:39:07,640 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-24 10:39:07,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:39:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:39:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:39:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:39:07,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:39:07,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:39:07,740 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:39:07,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:39:09,057 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 10:39:09,058 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:39:09,099 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:39:09,100 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:39:09,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:09 BoogieIcfgContainer [2024-10-24 10:39:09,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:39:09,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:39:09,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:39:09,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:39:09,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:07" (1/3) ... [2024-10-24 10:39:09,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4dbf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:09, skipping insertion in model container [2024-10-24 10:39:09,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:07" (2/3) ... [2024-10-24 10:39:09,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4dbf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:09, skipping insertion in model container [2024-10-24 10:39:09,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:09" (3/3) ... [2024-10-24 10:39:09,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-75.i [2024-10-24 10:39:09,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:39:09,126 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:39:09,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:39:09,187 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;@dd55d1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:39:09,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:39:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:39:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:39:09,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:09,201 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:39:09,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:09,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 452644599, now seen corresponding path program 1 times [2024-10-24 10:39:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:39:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630828253] [2024-10-24 10:39:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:09,220 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-24 10:39:09,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:39:09,224 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-24 10:39:09,225 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-24 10:39:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:39:09,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-24 10:39:09,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:39:09,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:39:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630828253] [2024-10-24 10:39:09,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630828253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:39:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962744544] [2024-10-24 10:39:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:09,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:39:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:39:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:39:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:39:09,568 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:39:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:10,302 INFO L93 Difference]: Finished difference Result 77 states and 130 transitions. [2024-10-24 10:39:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:39:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-24 10:39:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:10,326 INFO L225 Difference]: With dead ends: 77 [2024-10-24 10:39:10,327 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 10:39:10,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-24 10:39:10,335 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 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.7s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:10,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 10:39:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 10:39:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-24 10:39:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 10:39:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-24 10:39:10,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 88 [2024-10-24 10:39:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:10,374 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-24 10:39:10,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 10:39:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-24 10:39:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:39:10,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:10,377 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:39:10,388 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-24 10:39:10,578 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-24 10:39:10,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 469163327, now seen corresponding path program 1 times [2024-10-24 10:39:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:39:10,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993046829] [2024-10-24 10:39:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:10,580 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-24 10:39:10,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:39:10,583 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-24 10:39:10,584 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-24 10:39:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:39:10,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 10:39:11,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:39:11,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:39:11,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993046829] [2024-10-24 10:39:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993046829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:11,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:11,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:39:11,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787769789] [2024-10-24 10:39:11,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:11,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:39:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:39:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:39:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:11,150 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:39:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:12,367 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2024-10-24 10:39:12,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:39:12,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-24 10:39:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:12,382 INFO L225 Difference]: With dead ends: 113 [2024-10-24 10:39:12,383 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 10:39:12,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:39:12,384 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:12,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 166 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 10:39:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 10:39:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2024-10-24 10:39:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 10:39:12,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-10-24 10:39:12,401 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 88 [2024-10-24 10:39:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:12,401 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-10-24 10:39:12,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 10:39:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-10-24 10:39:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 10:39:12,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:12,403 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 10:39:12,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:39:12,603 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-24 10:39:12,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:12,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2050796607, now seen corresponding path program 1 times [2024-10-24 10:39:12,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:39:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440626013] [2024-10-24 10:39:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:12,605 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-24 10:39:12,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:39:12,608 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-24 10:39:12,612 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-24 10:39:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:12,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 10:39:12,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:36,502 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)