./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_variablewrapping_normal_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:03:10,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:03:10,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:03:10,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:03:10,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:03:10,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:03:10,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:03:10,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:03:10,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:03:10,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:03:10,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:03:10,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:03:10,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:03:10,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:03:10,456 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:03:10,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:03:10,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:03:10,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:03:10,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:03:10,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:03:10,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:03:10,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:03:10,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:03:10,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:03:10,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:03:10,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:03:10,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:03:10,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:03:10,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:03:10,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:03:10,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:03:10,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:03:10,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:10,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:03:10,465 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:03:10,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:03:10,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:03:10,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:03:10,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:03:10,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:03:10,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:03:10,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:03:10,467 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad [2024-10-24 11:03:10,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:03:10,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:03:10,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:03:10,789 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:03:10,790 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:03:10,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-10-24 11:03:12,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:03:12,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:03:12,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-10-24 11:03:12,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403408f60/c8edb5030cd64972a37bb2dc816449b5/FLAG4dfc3171f [2024-10-24 11:03:12,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403408f60/c8edb5030cd64972a37bb2dc816449b5 [2024-10-24 11:03:12,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:03:12,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:03:12,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:12,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:03:12,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:03:12,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42542d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12, skipping insertion in model container [2024-10-24 11:03:12,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:03:12,690 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_variablewrapping_normal_file-21.i[913,926] [2024-10-24 11:03:12,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:12,743 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:03:12,754 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_variablewrapping_normal_file-21.i[913,926] [2024-10-24 11:03:12,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:12,794 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:03:12,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12 WrapperNode [2024-10-24 11:03:12,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:12,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:12,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:03:12,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:03:12,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,864 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-10-24 11:03:12,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:12,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:03:12,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:03:12,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:03:12,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,897 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:03:12,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:03:12,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:03:12,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:03:12,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:03:12,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (1/1) ... [2024-10-24 11:03:12,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:03:12,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:03:12,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:03:13,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:03:13,023 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:03:13,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:03:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:03:13,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:03:13,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:03:13,105 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:03:13,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:03:13,397 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 11:03:13,397 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:03:13,437 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:03:13,438 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:03:13,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:13 BoogieIcfgContainer [2024-10-24 11:03:13,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:03:13,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:03:13,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:03:13,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:03:13,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:03:12" (1/3) ... [2024-10-24 11:03:13,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0a33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:13, skipping insertion in model container [2024-10-24 11:03:13,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:12" (2/3) ... [2024-10-24 11:03:13,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0a33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:13, skipping insertion in model container [2024-10-24 11:03:13,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:13" (3/3) ... [2024-10-24 11:03:13,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-21.i [2024-10-24 11:03:13,460 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:03:13,460 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:03:13,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:03:13,514 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;@616b2a36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:03:13,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:03:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:03:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 11:03:13,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:13,527 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:13,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1039608984, now seen corresponding path program 1 times [2024-10-24 11:03:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:03:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674430671] [2024-10-24 11:03:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:03:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:03:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:03:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:03:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:03:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:03:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:03:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:03:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:03:13,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:03:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674430671] [2024-10-24 11:03:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674430671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:03:13,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514719739] [2024-10-24 11:03:13,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:13,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:03:13,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:03:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:03:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:03:13,871 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:03:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:13,915 INFO L93 Difference]: Finished difference Result 63 states and 103 transitions. [2024-10-24 11:03:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:03:13,918 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), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2024-10-24 11:03:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:13,925 INFO L225 Difference]: With dead ends: 63 [2024-10-24 11:03:13,925 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 11:03:13,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:03:13,935 INFO L432 NwaCegarLoop]: 41 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, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:13,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:03:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 11:03:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-24 11:03:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:03:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-24 11:03:13,979 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 49 [2024-10-24 11:03:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:13,979 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-24 11:03:13,980 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), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:03:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-24 11:03:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 11:03:13,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:13,984 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:13,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:03:13,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:13,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 743328986, now seen corresponding path program 1 times [2024-10-24 11:03:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:03:13,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161550716] [2024-10-24 11:03:13,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:03:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:03:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:03:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:03:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:03:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:03:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:03:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:03:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:03:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:03:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161550716] [2024-10-24 11:03:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161550716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:03:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531246641] [2024-10-24 11:03:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:15,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:03:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:03:15,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:03:15,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:03:15,666 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:03:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:15,979 INFO L93 Difference]: Finished difference Result 111 states and 155 transitions. [2024-10-24 11:03:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:03:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 49 [2024-10-24 11:03:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:15,982 INFO L225 Difference]: With dead ends: 111 [2024-10-24 11:03:15,982 INFO L226 Difference]: Without dead ends: 81 [2024-10-24 11:03:15,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:03:15,984 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 62 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:15,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 207 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:03:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-24 11:03:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2024-10-24 11:03:15,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:03:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-10-24 11:03:16,001 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 49 [2024-10-24 11:03:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:16,001 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-10-24 11:03:16,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:03:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-10-24 11:03:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 11:03:16,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:16,007 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:16,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:03:16,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1684609692, now seen corresponding path program 1 times [2024-10-24 11:03:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:03:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94191879] [2024-10-24 11:03:16,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:03:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:03:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:03:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:03:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:03:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:03:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:03:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:03:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:03:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:03:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94191879] [2024-10-24 11:03:16,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94191879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:16,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:16,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:03:16,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202914156] [2024-10-24 11:03:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:16,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:03:16,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:03:16,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:03:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:03:16,848 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:03:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:17,564 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2024-10-24 11:03:17,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:03:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 51 [2024-10-24 11:03:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:17,568 INFO L225 Difference]: With dead ends: 180 [2024-10-24 11:03:17,568 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 11:03:17,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:03:17,570 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 116 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:17,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 246 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:03:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 11:03:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-10-24 11:03:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.223529411764706) internal successors, (104), 87 states have internal predecessors, (104), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 11:03:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 166 transitions. [2024-10-24 11:03:17,610 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 166 transitions. Word has length 51 [2024-10-24 11:03:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:17,611 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 166 transitions. [2024-10-24 11:03:17,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:03:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 166 transitions. [2024-10-24 11:03:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 11:03:17,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:17,613 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:17,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:03:17,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:17,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash 674424809, now seen corresponding path program 1 times [2024-10-24 11:03:17,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:03:17,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301552677] [2024-10-24 11:03:17,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:03:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:03:17,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2026348198] [2024-10-24 11:03:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:17,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:03:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:03:17,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:03:17,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:03:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:03:17,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:03:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:03:17,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:03:17,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:03:17,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:03:17,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:03:18,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:03:18,026 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:03:18,068 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:03:18,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:03:18 BoogieIcfgContainer [2024-10-24 11:03:18,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:03:18,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:03:18,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:03:18,072 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:03:18,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:13" (3/4) ... [2024-10-24 11:03:18,075 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:03:18,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:03:18,077 INFO L158 Benchmark]: Toolchain (without parser) took 5597.01ms. Allocated memory was 165.7MB in the beginning and 203.4MB in the end (delta: 37.7MB). Free memory was 134.4MB in the beginning and 75.6MB in the end (delta: 58.8MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-10-24 11:03:18,077 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:03:18,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.09ms. Allocated memory is still 165.7MB. Free memory was 134.4MB in the beginning and 120.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 11:03:18,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.61ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:03:18,078 INFO L158 Benchmark]: Boogie Preprocessor took 48.42ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:03:18,078 INFO L158 Benchmark]: RCFGBuilder took 524.22ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 126.9MB in the end (delta: -12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 11:03:18,079 INFO L158 Benchmark]: TraceAbstraction took 4630.87ms. Allocated memory was 165.7MB in the beginning and 203.4MB in the end (delta: 37.7MB). Free memory was 126.9MB in the beginning and 75.6MB in the end (delta: 51.3MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-10-24 11:03:18,079 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 203.4MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:03:18,081 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 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.09ms. Allocated memory is still 165.7MB. Free memory was 134.4MB in the beginning and 120.0MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.61ms. Allocated memory is still 165.7MB. Free memory was 120.0MB in the beginning and 117.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.42ms. Allocated memory is still 165.7MB. Free memory was 117.9MB in the beginning and 114.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 524.22ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 126.9MB in the end (delta: -12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4630.87ms. Allocated memory was 165.7MB in the beginning and 203.4MB in the end (delta: 37.7MB). Free memory was 126.9MB in the beginning and 75.6MB in the end (delta: 51.3MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 203.4MB. Free memory is still 75.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 someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 0; [L24] double var_1_8 = 15.6; [L25] double var_1_9 = 15.4; [L26] double var_1_10 = 32.2; [L27] unsigned char var_1_12 = 1; [L28] signed short int var_1_13 = 256; [L29] float var_1_14 = 5.75; [L30] float var_1_15 = 8.6; [L31] unsigned char last_1_var_1_7 = 0; [L32] signed short int last_1_var_1_13 = 256; [L84] isInitial = 1 [L85] FCALL initially() [L86] COND TRUE 1 [L87] CALL updateLastVariables() [L76] last_1_var_1_7 = var_1_7 [L77] last_1_var_1_13 = var_1_13 [L87] RET updateLastVariables() [L88] CALL updateVariables() [L61] var_1_8 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L62] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L65] var_1_10 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L66] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L67] var_1_12 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L68] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L88] RET updateVariables() [L89] CALL step() [L36] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L37] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L45] COND TRUE \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L46] COND TRUE (var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9) [L47] var_1_13 = ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L52] COND TRUE ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L53] COND FALSE !(last_1_var_1_7 && (var_1_1 >= var_1_1)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L89] RET step() [L90] CALL, EXPR property() [L80-L81] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? (var_1_1 == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_13))) && ((((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10) ? ((last_1_var_1_7 && (var_1_1 >= var_1_1)) ? (var_1_7 == ((unsigned char) 0)) : 1) : (var_1_7 == ((unsigned char) var_1_12)))) && (var_1_12 ? (((var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9)) ? (var_1_13 == ((signed short int) ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))))) : (var_1_13 == ((signed short int) var_1_1))) : 1) ; [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 494 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 148 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 252/252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:03:18,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:03:20,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:03:20,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:03:20,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:03:20,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:03:20,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:03:20,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:03:20,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:03:20,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:03:20,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:03:20,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:03:20,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:03:20,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:03:20,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:03:20,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:03:20,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:03:20,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:03:20,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:03:20,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:03:20,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:03:20,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:03:20,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:03:20,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:03:20,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:03:20,443 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:03:20,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:03:20,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:03:20,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:03:20,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:03:20,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:03:20,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:03:20,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:03:20,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:03:20,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:03:20,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:20,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:03:20,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:03:20,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:03:20,448 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:03:20,449 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:03:20,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:03:20,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:03:20,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:03:20,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:03:20,450 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:03:20,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53ac7479a950235157217cca437cf6f6e0f377d0e27ff61b959bf8258dd5b0ad [2024-10-24 11:03:20,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:03:20,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:03:20,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:03:20,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:03:20,804 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:03:20,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-10-24 11:03:22,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:03:22,669 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:03:22,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-21.i [2024-10-24 11:03:22,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca61fb03/d688fa82c2294cea9ccb96d174374428/FLAG4aa8a1f10 [2024-10-24 11:03:23,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ca61fb03/d688fa82c2294cea9ccb96d174374428 [2024-10-24 11:03:23,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:03:23,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:03:23,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:23,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:03:23,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:03:23,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b90e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23, skipping insertion in model container [2024-10-24 11:03:23,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:03:23,283 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_variablewrapping_normal_file-21.i[913,926] [2024-10-24 11:03:23,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:23,356 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:03:23,371 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_variablewrapping_normal_file-21.i[913,926] [2024-10-24 11:03:23,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:03:23,420 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:03:23,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23 WrapperNode [2024-10-24 11:03:23,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:03:23,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:23,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:03:23,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:03:23,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,477 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-10-24 11:03:23,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:03:23,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:03:23,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:03:23,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:03:23,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:03:23,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:03:23,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:03:23,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:03:23,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:03:23,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (1/1) ... [2024-10-24 11:03:23,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:03:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:03:23,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:03:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:03:23,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:03:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:03:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:03:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:03:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:03:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:03:23,706 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:03:23,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:03:29,535 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 11:03:29,536 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:03:29,587 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:03:29,588 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:03:29,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:29 BoogieIcfgContainer [2024-10-24 11:03:29,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:03:29,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:03:29,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:03:29,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:03:29,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:03:23" (1/3) ... [2024-10-24 11:03:29,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4005ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:29, skipping insertion in model container [2024-10-24 11:03:29,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:03:23" (2/3) ... [2024-10-24 11:03:29,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4005ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:03:29, skipping insertion in model container [2024-10-24 11:03:29,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:03:29" (3/3) ... [2024-10-24 11:03:29,610 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-21.i [2024-10-24 11:03:29,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:03:29,627 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:03:29,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:03:29,702 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;@7a68ef88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:03:29,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:03:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:03:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 11:03:29,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:29,716 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:29,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:29,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1039608984, now seen corresponding path program 1 times [2024-10-24 11:03:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:03:29,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228569743] [2024-10-24 11:03:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:29,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:29,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:03:29,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:03:29,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:03:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:29,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:03:29,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:03:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 11:03:29,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:03:29,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:03:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228569743] [2024-10-24 11:03:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228569743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:29,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:29,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:03:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740353359] [2024-10-24 11:03:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:03:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:03:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:03:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:03:29,979 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:03:31,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:31,299 INFO L93 Difference]: Finished difference Result 63 states and 103 transitions. [2024-10-24 11:03:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:03:31,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2024-10-24 11:03:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:31,329 INFO L225 Difference]: With dead ends: 63 [2024-10-24 11:03:31,329 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 11:03:31,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:03:31,335 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:31,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:03:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 11:03:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-24 11:03:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 11:03:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-24 11:03:31,365 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 49 [2024-10-24 11:03:31,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:31,366 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-24 11:03:31,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 11:03:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-24 11:03:31,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 11:03:31,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:31,368 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:31,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:03:31,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:31,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 743328986, now seen corresponding path program 1 times [2024-10-24 11:03:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:03:31,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686585462] [2024-10-24 11:03:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:31,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:03:31,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:03:31,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:03:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:31,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:03:31,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:03:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:03:32,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:03:32,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:03:32,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686585462] [2024-10-24 11:03:32,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686585462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:03:32,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:03:32,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:03:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124608926] [2024-10-24 11:03:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:03:32,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:03:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:03:32,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:03:32,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:03:32,126 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:03:34,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:36,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:37,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:40,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:40,477 INFO L93 Difference]: Finished difference Result 98 states and 138 transitions. [2024-10-24 11:03:40,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:03:40,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 49 [2024-10-24 11:03:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:40,503 INFO L225 Difference]: With dead ends: 98 [2024-10-24 11:03:40,503 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 11:03:40,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:03:40,505 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 47 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:40,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 113 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-10-24 11:03:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 11:03:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2024-10-24 11:03:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:03:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2024-10-24 11:03:40,521 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 49 [2024-10-24 11:03:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:40,522 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2024-10-24 11:03:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 11:03:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2024-10-24 11:03:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 11:03:40,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:40,524 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:40,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:03:40,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:40,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:40,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1586302373, now seen corresponding path program 1 times [2024-10-24 11:03:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:03:40,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565221847] [2024-10-24 11:03:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:40,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:03:40,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:03:40,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:03:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:40,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:03:40,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:03:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-24 11:03:41,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:03:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 11:03:41,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:03:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565221847] [2024-10-24 11:03:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565221847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:03:41,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:03:41,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 11:03:41,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550892000] [2024-10-24 11:03:41,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:03:41,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:03:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:03:41,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:03:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:03:41,324 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:03:43,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:03:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:03:43,737 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2024-10-24 11:03:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:03:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 50 [2024-10-24 11:03:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:03:43,771 INFO L225 Difference]: With dead ends: 116 [2024-10-24 11:03:43,771 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 11:03:43,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:03:43,776 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:03:43,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 11:03:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 11:03:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-24 11:03:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:03:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-10-24 11:03:43,796 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 50 [2024-10-24 11:03:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:03:43,796 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-10-24 11:03:43,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:03:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-10-24 11:03:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 11:03:43,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:03:43,798 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:03:43,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 11:03:44,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:44,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:03:44,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:03:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1684609692, now seen corresponding path program 1 times [2024-10-24 11:03:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:03:44,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654726441] [2024-10-24 11:03:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:03:44,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:03:44,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:03:44,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:03:44,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:03:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:03:44,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:03:44,244 INFO L278 TraceCheckSpWp]: Computing forward predicates...