./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:21:34,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:21:34,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:21:34,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:21:34,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:21:34,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:21:34,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:21:34,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:21:34,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:21:34,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:21:34,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:21:34,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:21:34,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:21:34,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:21:34,485 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:21:34,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:21:34,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:21:34,486 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:21:34,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:21:34,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:21:34,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:21:34,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:21:34,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:21:34,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:21:34,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:21:34,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:21:34,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:21:34,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:21:34,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:21:34,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:21:34,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:21:34,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:21:34,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:34,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:21:34,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:21:34,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:21:34,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:21:34,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:21:34,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:21:34,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:21:34,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:21:34,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:21:34,492 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-clean/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-clean/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 -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2024-10-11 12:21:34,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:21:34,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:21:34,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:21:34,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:21:34,793 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:21:34,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-10-11 12:21:36,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:21:36,490 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:21:36,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-10-11 12:21:36,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/742d48bdb/6ad6169a80e24d4ba919ebf89cff5d6b/FLAG48678e3ce [2024-10-11 12:21:36,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/742d48bdb/6ad6169a80e24d4ba919ebf89cff5d6b [2024-10-11 12:21:36,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:21:36,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:21:36,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:36,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:21:36,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:21:36,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281d748b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36, skipping insertion in model container [2024-10-11 12:21:36,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:21:36,736 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-10-11 12:21:36,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:36,774 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:21:36,786 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-10-11 12:21:36,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:36,821 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:21:36,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36 WrapperNode [2024-10-11 12:21:36,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:36,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:36,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:21:36,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:21:36,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,908 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-10-11 12:21:36,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:36,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:21:36,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:21:36,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:21:36,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,946 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-11 12:21:36,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:21:36,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:21:36,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:21:36,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:21:36,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (1/1) ... [2024-10-11 12:21:36,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:21:37,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:21:37,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:21:37,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:21:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:21:37,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:21:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:21:37,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:21:37,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:21:37,145 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:21:37,147 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:21:37,386 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:21:37,387 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:21:37,441 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:21:37,445 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:21:37,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:37 BoogieIcfgContainer [2024-10-11 12:21:37,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:21:37,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:21:37,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:21:37,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:21:37,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:36" (1/3) ... [2024-10-11 12:21:37,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b10bac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:37, skipping insertion in model container [2024-10-11 12:21:37,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:36" (2/3) ... [2024-10-11 12:21:37,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b10bac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:37, skipping insertion in model container [2024-10-11 12:21:37,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:37" (3/3) ... [2024-10-11 12:21:37,459 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2024-10-11 12:21:37,476 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:21:37,476 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:21:37,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:21:37,558 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;@800c236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:21:37,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:21:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:21:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:21:37,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:37,577 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:21:37,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:37,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:37,584 INFO L85 PathProgramCache]: Analyzing trace with hash -933343933, now seen corresponding path program 1 times [2024-10-11 12:21:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:21:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641575877] [2024-10-11 12:21:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:21:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:21:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:21:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:21:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:21:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:21:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:21:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:21:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:21:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:21:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:21:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:21:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 12:21:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:21:37,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641575877] [2024-10-11 12:21:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641575877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:21:37,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:21:37,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:21:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367665363] [2024-10-11 12:21:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:37,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:21:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:21:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:21:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:21:37,894 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 12:21:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:37,922 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2024-10-11 12:21:37,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:21:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2024-10-11 12:21:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:37,933 INFO L225 Difference]: With dead ends: 61 [2024-10-11 12:21:37,933 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 12:21:37,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-11 12:21:37,941 INFO L432 NwaCegarLoop]: 39 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, 39 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-11 12:21:37,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:21:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 12:21:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 12:21:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:21:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2024-10-11 12:21:37,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 67 [2024-10-11 12:21:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:37,986 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2024-10-11 12:21:37,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 12:21:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2024-10-11 12:21:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:21:37,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:37,990 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:21:37,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:21:37,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:37,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1246260673, now seen corresponding path program 1 times [2024-10-11 12:21:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:21:37,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090510788] [2024-10-11 12:21:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:21:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:21:38,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:21:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:21:38,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:21:38,249 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:21:38,251 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:21:38,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:21:38,257 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:21:38,310 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:21:38,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:38 BoogieIcfgContainer [2024-10-11 12:21:38,315 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:21:38,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:21:38,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:21:38,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:21:38,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:37" (3/4) ... [2024-10-11 12:21:38,319 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:21:38,320 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:21:38,321 INFO L158 Benchmark]: Toolchain (without parser) took 1791.20ms. Allocated memory is still 180.4MB. Free memory was 114.7MB in the beginning and 88.6MB in the end (delta: 26.1MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:38,321 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:38,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.82ms. Allocated memory is still 180.4MB. Free memory was 114.5MB in the beginning and 101.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:38,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.40ms. Allocated memory is still 180.4MB. Free memory was 101.6MB in the beginning and 153.3MB in the end (delta: -51.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:38,323 INFO L158 Benchmark]: Boogie Preprocessor took 56.93ms. Allocated memory is still 180.4MB. Free memory was 153.3MB in the beginning and 151.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:38,323 INFO L158 Benchmark]: RCFGBuilder took 478.74ms. Allocated memory is still 180.4MB. Free memory was 151.5MB in the beginning and 134.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:21:38,324 INFO L158 Benchmark]: TraceAbstraction took 867.36ms. Allocated memory is still 180.4MB. Free memory was 134.1MB in the beginning and 88.6MB in the end (delta: 45.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-11 12:21:38,324 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 180.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:38,326 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.16ms. Allocated memory is still 109.1MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.82ms. Allocated memory is still 180.4MB. Free memory was 114.5MB in the beginning and 101.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.40ms. Allocated memory is still 180.4MB. Free memory was 101.6MB in the beginning and 153.3MB in the end (delta: -51.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.93ms. Allocated memory is still 180.4MB. Free memory was 153.3MB in the beginning and 151.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 478.74ms. Allocated memory is still 180.4MB. Free memory was 151.5MB in the beginning and 134.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 867.36ms. Allocated memory is still 180.4MB. Free memory was 134.1MB in the beginning and 88.6MB in the end (delta: 45.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 180.4MB. Free memory is still 88.6MB. 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 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_3 = 64; [L24] signed long int var_1_4 = 5; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned long int var_1_8 = 0; [L29] float var_1_9 = 256.75; [L30] float var_1_10 = 99.2; [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L46] var_1_3 = __VERIFIER_nondet_ushort() [L47] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L47] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L48] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L49] var_1_4 = __VERIFIER_nondet_long() [L50] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L50] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L51] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L52] var_1_5 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L53] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L54] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L55] var_1_6 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L56] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L57] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L58] var_1_7 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L59] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_8=0, var_1_9=1027/4] [L60] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L60] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_10=496/5, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L62] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=1027/4] [L75] RET updateVariables() [L76] CALL step() [L34] var_1_8 = var_1_3 [L35] var_1_9 = var_1_10 [L36] signed long int stepLocal_0 = 10 - var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_10=261, var_1_1=1, var_1_3=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=261] [L37] COND TRUE (var_1_8 + var_1_8) > stepLocal_0 [L38] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=261] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return ((((var_1_8 + var_1_8) > (10 - var_1_4)) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_5 ? (var_1_1 == ((unsigned char) (var_1_6 || var_1_7))) : 1)) && (var_1_8 == ((unsigned long int) var_1_3))) && (var_1_9 == ((float) var_1_10)) ; [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=261] [L19] reach_error() VAL [isInitial=1, var_1_10=261, var_1_1=-255, var_1_3=1, var_1_4=10, var_1_5=-255, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=261] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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-11 12:21:38,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:21:40,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:21:40,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:21:40,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:21:40,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:21:40,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:21:40,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:21:40,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:21:40,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:21:40,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:21:40,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:21:40,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:21:40,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:21:40,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:21:40,766 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:21:40,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:21:40,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:21:40,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:21:40,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:21:40,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:21:40,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:21:40,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:21:40,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:21:40,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:21:40,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:21:40,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:21:40,771 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:21:40,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:21:40,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:21:40,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:21:40,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:21:40,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:21:40,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:21:40,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:21:40,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:40,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:21:40,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:21:40,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:21:40,775 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:21:40,775 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:21:40,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:21:40,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:21:40,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:21:40,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:21:40,777 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:21:40,778 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-clean/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-clean/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 -> e560e39513eb26595349bb5183c466d93aeda0a374e3c004705ee1f38a5b90f4 [2024-10-11 12:21:41,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:21:41,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:21:41,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:21:41,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:21:41,134 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:21:41,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-10-11 12:21:42,792 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:21:42,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:21:42,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i [2024-10-11 12:21:43,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9ab9e9810/3c176021f8aa4713ba403f6d07e4e181/FLAGf186773ea [2024-10-11 12:21:43,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9ab9e9810/3c176021f8aa4713ba403f6d07e4e181 [2024-10-11 12:21:43,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:21:43,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:21:43,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:43,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:21:43,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:21:43,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f267b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43, skipping insertion in model container [2024-10-11 12:21:43,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:21:43,273 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-10-11 12:21:43,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:43,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:21:43,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-87.i[915,928] [2024-10-11 12:21:43,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:21:43,381 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:21:43,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43 WrapperNode [2024-10-11 12:21:43,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:21:43,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:43,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:21:43,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:21:43,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,427 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-11 12:21:43,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:21:43,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:21:43,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:21:43,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:21:43,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,470 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-11 12:21:43,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:21:43,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:21:43,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:21:43,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:21:43,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (1/1) ... [2024-10-11 12:21:43,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:21:43,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:21:43,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:21:43,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:21:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:21:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:21:43,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:21:43,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:21:43,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:21:43,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:21:43,658 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:21:43,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:21:43,922 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:21:43,922 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:21:43,977 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:21:43,977 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:21:43,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:43 BoogieIcfgContainer [2024-10-11 12:21:43,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:21:43,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:21:43,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:21:43,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:21:43,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:21:43" (1/3) ... [2024-10-11 12:21:43,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36920377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:43, skipping insertion in model container [2024-10-11 12:21:43,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:21:43" (2/3) ... [2024-10-11 12:21:43,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36920377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:21:43, skipping insertion in model container [2024-10-11 12:21:43,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:43" (3/3) ... [2024-10-11 12:21:43,989 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-87.i [2024-10-11 12:21:44,007 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:21:44,009 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:21:44,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:21:44,087 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;@192d6cd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:21:44,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:21:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:21:44,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:21:44,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:44,103 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:21:44,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:44,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash -933343933, now seen corresponding path program 1 times [2024-10-11 12:21:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266390093] [2024-10-11 12:21:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:44,126 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-11 12:21:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:44,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 12:21:44,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:21:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:44,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:21:44,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-11 12:21:44,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:21:44,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266390093] [2024-10-11 12:21:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266390093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:21:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:21:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:21:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643644346] [2024-10-11 12:21:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:21:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:21:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:21:44,415 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:21:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:44,455 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2024-10-11 12:21:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:21:44,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2024-10-11 12:21:44,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:44,467 INFO L225 Difference]: With dead ends: 61 [2024-10-11 12:21:44,467 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 12:21:44,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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-11 12:21:44,475 INFO L432 NwaCegarLoop]: 39 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, 39 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-11 12:21:44,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:21:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 12:21:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 12:21:44,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:21:44,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2024-10-11 12:21:44,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 67 [2024-10-11 12:21:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:44,525 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2024-10-11 12:21:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:21:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2024-10-11 12:21:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 12:21:44,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:44,530 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:21:44,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:21:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 12:21:44,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1246260673, now seen corresponding path program 1 times [2024-10-11 12:21:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153568402] [2024-10-11 12:21:44,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:44,734 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-11 12:21:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:44,737 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 12:21:44,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:21:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:44,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 12:21:44,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-11 12:21:47,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:21:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 12:21:48,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153568402] [2024-10-11 12:21:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153568402] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:21:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:21:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2024-10-11 12:21:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935022182] [2024-10-11 12:21:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:48,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:21:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:21:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-11 12:21:48,744 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:21:49,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:49,178 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2024-10-11 12:21:49,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:21:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 67 [2024-10-11 12:21:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:49,181 INFO L225 Difference]: With dead ends: 43 [2024-10-11 12:21:49,182 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 12:21:49,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-10-11 12:21:49,184 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:21:49,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 82 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:21:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 12:21:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-10-11 12:21:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:21:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-10-11 12:21:49,200 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 67 [2024-10-11 12:21:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:49,200 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-10-11 12:21:49,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:21:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-10-11 12:21:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 12:21:49,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:49,205 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:21:49,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:21:49,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 12:21:49,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:49,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash -20516218, now seen corresponding path program 1 times [2024-10-11 12:21:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:49,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766091782] [2024-10-11 12:21:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:49,412 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-11 12:21:49,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:49,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 12:21:49,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 12:21:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:49,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 12:21:49,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-11 12:21:51,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:21:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 12:21:53,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:53,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766091782] [2024-10-11 12:21:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766091782] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:21:53,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:21:53,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2024-10-11 12:21:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745988937] [2024-10-11 12:21:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:21:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:21:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:21:53,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-10-11 12:21:53,526 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:21:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:53,929 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-11 12:21:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 12:21:53,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 68 [2024-10-11 12:21:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:53,932 INFO L225 Difference]: With dead ends: 48 [2024-10-11 12:21:53,932 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 12:21:53,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-10-11 12:21:53,933 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:21:53,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 77 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:21:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 12:21:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-10-11 12:21:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 12:21:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-10-11 12:21:53,948 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 68 [2024-10-11 12:21:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:53,949 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-10-11 12:21:53,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 12:21:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-10-11 12:21:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 12:21:53,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:21:53,950 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 12:21:53,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 12:21:54,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 12:21:54,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:21:54,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:21:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash -20456636, now seen corresponding path program 1 times [2024-10-11 12:21:54,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:21:54,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241989608] [2024-10-11 12:21:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:21:54,153 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-11 12:21:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:21:54,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 12:21:54,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:21:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:21:54,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:21:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:21:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-11 12:21:54,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:21:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 12:21:54,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:21:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241989608] [2024-10-11 12:21:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241989608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:21:54,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:21:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 12:21:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250784872] [2024-10-11 12:21:54,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:21:54,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:21:54,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:21:54,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:21:54,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:21:54,381 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 12:21:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:21:54,480 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2024-10-11 12:21:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:21:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 68 [2024-10-11 12:21:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:21:54,482 INFO L225 Difference]: With dead ends: 81 [2024-10-11 12:21:54,483 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:21:54,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:21:54,486 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:21:54,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:21:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:21:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:21:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 12:21:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:21:54,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2024-10-11 12:21:54,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:21:54,490 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:21:54,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 12:21:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:21:54,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:21:54,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:21:54,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 12:21:54,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 12:21:54,699 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 12:21:54,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:21:55,255 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:21:55,266 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-11 12:21:55,272 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-11 12:21:55,273 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-11 12:21:55,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:21:55 BoogieIcfgContainer [2024-10-11 12:21:55,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:21:55,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:21:55,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:21:55,275 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:21:55,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:21:43" (3/4) ... [2024-10-11 12:21:55,278 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:21:55,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:21:55,285 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 12:21:55,285 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 12:21:55,286 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:21:55,286 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:21:55,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:21:55,393 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:21:55,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:21:55,393 INFO L158 Benchmark]: Toolchain (without parser) took 12352.28ms. Allocated memory was 65.0MB in the beginning and 570.4MB in the end (delta: 505.4MB). Free memory was 35.4MB in the beginning and 355.0MB in the end (delta: -319.6MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:55,393 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 26.6MB in the beginning and 26.6MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:55,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.70ms. Allocated memory is still 65.0MB. Free memory was 35.2MB in the beginning and 39.6MB in the end (delta: -4.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-11 12:21:55,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.86ms. Allocated memory is still 65.0MB. Free memory was 39.6MB in the beginning and 37.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:21:55,394 INFO L158 Benchmark]: Boogie Preprocessor took 68.53ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 35.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:21:55,394 INFO L158 Benchmark]: RCFGBuilder took 478.98ms. Allocated memory is still 65.0MB. Free memory was 35.7MB in the beginning and 37.4MB in the end (delta: -1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:21:55,394 INFO L158 Benchmark]: TraceAbstraction took 11293.64ms. Allocated memory was 65.0MB in the beginning and 570.4MB in the end (delta: 505.4MB). Free memory was 36.8MB in the beginning and 360.2MB in the end (delta: -323.4MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. [2024-10-11 12:21:55,395 INFO L158 Benchmark]: Witness Printer took 117.72ms. Allocated memory is still 570.4MB. Free memory was 360.2MB in the beginning and 355.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:21:55,397 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 46.1MB. Free memory was 26.6MB in the beginning and 26.6MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.70ms. Allocated memory is still 65.0MB. Free memory was 35.2MB in the beginning and 39.6MB in the end (delta: -4.5MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.86ms. Allocated memory is still 65.0MB. Free memory was 39.6MB in the beginning and 37.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.53ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 35.7MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 478.98ms. Allocated memory is still 65.0MB. Free memory was 35.7MB in the beginning and 37.4MB in the end (delta: -1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11293.64ms. Allocated memory was 65.0MB in the beginning and 570.4MB in the end (delta: 505.4MB). Free memory was 36.8MB in the beginning and 360.2MB in the end (delta: -323.4MB). Peak memory consumption was 180.8MB. Max. memory is 16.1GB. * Witness Printer took 117.72ms. Allocated memory is still 570.4MB. Free memory was 360.2MB in the beginning and 355.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 4, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 235 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 120 mSDtfsCounter, 235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 466 ConstructedInterpolants, 9 QuantifiedInterpolants, 2020 SizeOfPredicates, 30 NumberOfNonLiveVariables, 457 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1462/1540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (var_1_5 >= 1) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:21:55,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE