./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.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 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:00:11,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:00:11,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:00:11,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:00:11,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:00:11,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:00:11,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:00:11,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:00:11,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:00:11,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:00:11,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:00:11,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:00:11,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:00:11,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:00:11,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:00:11,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:00:11,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:00:11,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:00:11,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:00:11,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:00:11,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:00:11,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:00:11,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:00:11,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:00:11,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:00:11,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:00:11,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:00:11,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:00:11,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:00:11,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:00:11,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:00:11,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:00:11,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:00:11,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:00:11,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:00:11,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:00:11,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:00:11,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:00:11,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:00:11,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:00:11,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:00:11,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:00:11,737 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 -> 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 [2024-11-10 09:00:11,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:00:11,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:00:11,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:00:11,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:00:11,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:00:12,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-10 09:00:13,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:00:13,719 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:00:13,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-10 09:00:13,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1c4c64d/4b0859dc02414f8a9e34ea3c604f2410/FLAG7f55ece10 [2024-11-10 09:00:13,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1c4c64d/4b0859dc02414f8a9e34ea3c604f2410 [2024-11-10 09:00:13,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:00:13,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:00:13,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:00:13,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:00:13,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:00:13,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:13" (1/1) ... [2024-11-10 09:00:13,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3441b421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:13, skipping insertion in model container [2024-11-10 09:00:13,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:13" (1/1) ... [2024-11-10 09:00:13,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:00:14,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i[912,925] [2024-11-10 09:00:14,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:00:14,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:00:14,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i[912,925] [2024-11-10 09:00:14,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:00:14,110 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:00:14,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14 WrapperNode [2024-11-10 09:00:14,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:00:14,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:00:14,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:00:14,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:00:14,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,161 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-10 09:00:14,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:00:14,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:00:14,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:00:14,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:00:14,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:00:14,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:00:14,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:00:14,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:00:14,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:00:14,204 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (1/1) ... [2024-11-10 09:00:14,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:00:14,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:00:14,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:00:14,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:00:14,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:00:14,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:00:14,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:00:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:00:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:00:14,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:00:14,412 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:00:14,415 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:00:14,714 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2024-11-10 09:00:14,759 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 09:00:14,759 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:00:14,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:00:14,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:00:14,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:14 BoogieIcfgContainer [2024-11-10 09:00:14,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:00:14,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:00:14,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:00:14,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:00:14,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:00:13" (1/3) ... [2024-11-10 09:00:14,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303a002b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:14, skipping insertion in model container [2024-11-10 09:00:14,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:14" (2/3) ... [2024-11-10 09:00:14,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303a002b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:14, skipping insertion in model container [2024-11-10 09:00:14,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:14" (3/3) ... [2024-11-10 09:00:14,795 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-1.i [2024-11-10 09:00:14,812 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:00:14,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:00:14,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:00:14,894 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;@74894bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:00:14,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:00:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:00:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:00:14,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:00:14,913 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:00:14,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:00:14,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:00:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1628668083, now seen corresponding path program 1 times [2024-11-10 09:00:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:00:14,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000975339] [2024-11-10 09:00:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:00:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:00:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:00:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 09:00:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:00:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 09:00:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 09:00:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 09:00:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 09:00:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 09:00:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 09:00:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 09:00:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 09:00:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 09:00:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 09:00:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:00:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-10 09:00:15,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:00:15,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000975339] [2024-11-10 09:00:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000975339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:00:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:00:15,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:00:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019267052] [2024-11-10 09:00:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:00:15,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:00:15,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:00:15,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:00:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:00:15,339 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:00:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:00:15,372 INFO L93 Difference]: Finished difference Result 114 states and 179 transitions. [2024-11-10 09:00:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:00:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-10 09:00:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:00:15,385 INFO L225 Difference]: With dead ends: 114 [2024-11-10 09:00:15,385 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 09:00:15,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:00:15,395 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:00:15,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:00:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 09:00:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 09:00:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:00:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-10 09:00:15,482 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 99 [2024-11-10 09:00:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:00:15,483 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-10 09:00:15,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:00:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-10 09:00:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 09:00:15,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:00:15,489 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:00:15,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:00:15,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:00:15,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:00:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1315641769, now seen corresponding path program 1 times [2024-11-10 09:00:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:00:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901862196] [2024-11-10 09:00:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:00:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:00:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:00:15,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:00:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:00:15,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:00:15,718 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:00:15,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:00:15,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:00:15,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:00:15,803 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:00:15,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:00:15 BoogieIcfgContainer [2024-11-10 09:00:15,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:00:15,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:00:15,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:00:15,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:00:15,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:14" (3/4) ... [2024-11-10 09:00:15,813 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:00:15,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:00:15,815 INFO L158 Benchmark]: Toolchain (without parser) took 2058.04ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 58.6MB in the beginning and 106.8MB in the end (delta: -48.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:00:15,816 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 127.9MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:00:15,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.10ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 58.3MB in the beginning and 125.0MB in the end (delta: -66.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-10 09:00:15,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:00:15,818 INFO L158 Benchmark]: Boogie Preprocessor took 39.19ms. Allocated memory is still 161.5MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:00:15,819 INFO L158 Benchmark]: IcfgBuilder took 584.21ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 101.8MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:00:15,821 INFO L158 Benchmark]: TraceAbstraction took 1018.72ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 107.8MB in the end (delta: -6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:00:15,821 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 161.5MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:00:15,823 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.21ms. Allocated memory is still 127.9MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.10ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 58.3MB in the beginning and 125.0MB in the end (delta: -66.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.19ms. Allocated memory is still 161.5MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 584.21ms. Allocated memory is still 161.5MB. Free memory was 120.8MB in the beginning and 101.8MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1018.72ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 107.8MB in the end (delta: -6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 161.5MB. Free memory is still 106.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 5.5; [L23] float var_1_2 = 10.375; [L24] float var_1_3 = 127.5; [L25] float var_1_4 = 256.2; [L26] unsigned char var_1_5 = 1; [L27] signed long int var_1_6 = 5; [L28] unsigned char var_1_7 = 1; [L29] signed long int var_1_10 = 32; [L30] signed long int var_1_11 = 2; [L31] unsigned long int var_1_12 = 16; [L32] unsigned char var_1_13 = 50; [L33] signed long int var_1_15 = 100000000; [L34] signed short int var_1_16 = 2; [L35] unsigned long int last_1_var_1_12 = 16; VAL [isInitial=0, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_2=83/8, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_2=83/8, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L71] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L72] var_1_3 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L73] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L74] var_1_4 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L75] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L78] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L78] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L79] var_1_7 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L81] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L84] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L84] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L87] CALL assume_abort_if_not(var_1_11 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L87] RET assume_abort_if_not(var_1_11 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L90] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L90] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L91] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L91] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L105] RET updateVariables() [L106] CALL step() [L39] COND TRUE var_1_2 <= (- var_1_3) [L40] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=5, var_1_7=-255] [L48] var_1_16 = var_1_13 [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_0=-255, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=5, var_1_7=-255] [L50] COND TRUE var_1_5 || stepLocal_0 [L51] var_1_6 = ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L55] signed long int stepLocal_3 = var_1_11; [L56] signed long int stepLocal_2 = var_1_16 + var_1_11; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L57] EXPR var_1_11 << var_1_16 VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L57] signed long int stepLocal_1 = var_1_11 << var_1_16; [L58] COND FALSE !(stepLocal_1 != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L67] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L97-L98] return (((((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1)) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_13)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:00:15,865 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.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 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:00:18,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:00:18,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:00:18,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:00:18,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:00:18,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:00:18,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:00:18,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:00:18,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:00:18,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:00:18,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:00:18,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:00:18,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:00:18,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:00:18,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:00:18,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:00:18,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:00:18,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:00:18,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:00:18,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:00:18,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:00:18,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:00:18,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:00:18,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:00:18,282 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:00:18,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:00:18,283 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:00:18,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:00:18,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:00:18,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:00:18,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:00:18,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:00:18,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:00:18,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:00:18,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:00:18,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:00:18,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:00:18,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:00:18,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:00:18,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:00:18,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:00:18,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:00:18,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:00:18,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:00:18,288 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 -> 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 [2024-11-10 09:00:18,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:00:18,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:00:18,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:00:18,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:00:18,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:00:18,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-10 09:00:20,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:00:20,521 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:00:20,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2024-11-10 09:00:20,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3846945/1f402903883e413b90c29149fdec18ad/FLAGa9419a5ad [2024-11-10 09:00:20,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e3846945/1f402903883e413b90c29149fdec18ad [2024-11-10 09:00:20,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:00:20,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:00:20,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:00:20,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:00:20,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:00:20,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:20,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b21df77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20, skipping insertion in model container [2024-11-10 09:00:20,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:20,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:00:20,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i[912,925] [2024-11-10 09:00:20,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:00:20,866 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:00:20,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i[912,925] [2024-11-10 09:00:20,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:00:20,947 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:00:20,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20 WrapperNode [2024-11-10 09:00:20,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:00:20,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:00:20,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:00:20,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:00:20,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:20,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,001 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-10 09:00:21,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:00:21,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:00:21,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:00:21,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:00:21,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 09:00:21,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,052 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:00:21,066 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:00:21,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:00:21,067 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:00:21,068 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (1/1) ... [2024-11-10 09:00:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:00:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:00:21,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 09:00:21,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 09:00:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:00:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:00:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:00:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:00:21,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:00:21,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:00:21,220 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:00:21,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:00:21,554 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 09:00:21,558 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:00:21,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:00:21,579 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:00:21,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:21 BoogieIcfgContainer [2024-11-10 09:00:21,580 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:00:21,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:00:21,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:00:21,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:00:21,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:00:20" (1/3) ... [2024-11-10 09:00:21,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1469ad7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:21, skipping insertion in model container [2024-11-10 09:00:21,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:00:20" (2/3) ... [2024-11-10 09:00:21,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1469ad7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:00:21, skipping insertion in model container [2024-11-10 09:00:21,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:00:21" (3/3) ... [2024-11-10 09:00:21,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-1.i [2024-11-10 09:00:21,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:00:21,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:00:21,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:00:21,679 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;@66a29d10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:00:21,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:00:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:00:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 09:00:21,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:00:21,698 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:00:21,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:00:21,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:00:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash 452890928, now seen corresponding path program 1 times [2024-11-10 09:00:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:00:21,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416868211] [2024-11-10 09:00:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:00:21,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:00:21,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:00:21,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:00:21,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 09:00:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:21,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:00:21,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:00:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-10 09:00:21,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:00:21,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:00:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416868211] [2024-11-10 09:00:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416868211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:00:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:00:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:00:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068048473] [2024-11-10 09:00:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:00:21,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:00:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:00:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:00:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:00:22,029 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:00:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:00:22,060 INFO L93 Difference]: Finished difference Result 98 states and 157 transitions. [2024-11-10 09:00:22,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:00:22,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2024-11-10 09:00:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:00:22,071 INFO L225 Difference]: With dead ends: 98 [2024-11-10 09:00:22,071 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 09:00:22,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:00:22,077 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 09:00:22,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:00:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 09:00:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-10 09:00:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-10 09:00:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-10 09:00:22,112 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 95 [2024-11-10 09:00:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:00:22,113 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-10 09:00:22,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-10 09:00:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-10 09:00:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 09:00:22,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:00:22,116 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:00:22,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 09:00:22,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:00:22,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:00:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:00:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash -214144812, now seen corresponding path program 1 times [2024-11-10 09:00:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:00:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055951472] [2024-11-10 09:00:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:00:22,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 09:00:22,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:00:22,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 09:00:22,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 09:00:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:00:22,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 09:00:22,513 INFO L278 TraceCheckSpWp]: Computing forward predicates...