./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.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 c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:32:21,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:32:21,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:32:21,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:32:21,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:32:21,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:32:21,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:32:21,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:32:21,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:32:21,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:32:21,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:32:21,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:32:21,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:32:21,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:32:21,727 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:32:21,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:32:21,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:32:21,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:32:21,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:32:21,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:32:21,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:32:21,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:32:21,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:32:21,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:32:21,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:32:21,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:32:21,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:32:21,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:32:21,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:32:21,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:32:21,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:32:21,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:32:21,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:32:21,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:32:21,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:32:21,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:32:21,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:32:21,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:32:21,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:32:21,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:32:21,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:32:21,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:32:21,739 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 -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2024-10-24 08:32:22,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:32:22,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:32:22,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:32:22,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:32:22,036 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:32:22,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i [2024-10-24 08:32:23,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:32:23,683 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:32:23,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i [2024-10-24 08:32:23,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe163e75e/8986c41c6f9a4205879ecfa42b3b8024/FLAG39e16df2c [2024-10-24 08:32:23,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe163e75e/8986c41c6f9a4205879ecfa42b3b8024 [2024-10-24 08:32:23,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:32:23,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:32:23,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:32:23,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:32:23,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:32:23,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:32:23" (1/1) ... [2024-10-24 08:32:23,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2637c2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:23, skipping insertion in model container [2024-10-24 08:32:23,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:32:23" (1/1) ... [2024-10-24 08:32:23,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:32:23,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i[913,926] [2024-10-24 08:32:23,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:32:24,002 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:32:24,014 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i[913,926] [2024-10-24 08:32:24,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:32:24,077 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:32:24,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24 WrapperNode [2024-10-24 08:32:24,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:32:24,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:32:24,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:32:24,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:32:24,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,136 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-24 08:32:24,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:32:24,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:32:24,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:32:24,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:32:24,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,181 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:32:24,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:32:24,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:32:24,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:32:24,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:32:24,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (1/1) ... [2024-10-24 08:32:24,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:32:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:32:24,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-10-24 08:32:24,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:32:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:32:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:32:24,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:32:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:32:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:32:24,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:32:24,394 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:32:24,396 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:32:24,689 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 08:32:24,689 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:32:24,769 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:32:24,770 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:32:24,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:32:24 BoogieIcfgContainer [2024-10-24 08:32:24,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:32:24,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:32:24,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:32:24,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:32:24,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:32:23" (1/3) ... [2024-10-24 08:32:24,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284cd47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:32:24, skipping insertion in model container [2024-10-24 08:32:24,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:24" (2/3) ... [2024-10-24 08:32:24,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284cd47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:32:24, skipping insertion in model container [2024-10-24 08:32:24,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:32:24" (3/3) ... [2024-10-24 08:32:24,781 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-32.i [2024-10-24 08:32:24,798 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:32:24,798 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:32:24,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:32:24,861 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;@1d86bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:32:24,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:32:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 08:32:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 08:32:24,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:24,883 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:24,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:24,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1560032807, now seen corresponding path program 1 times [2024-10-24 08:32:24,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:32:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248261617] [2024-10-24 08:32:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:32:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:32:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:32:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:32:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:32:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:32:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:32:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:32:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:32:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:32:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:32:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:32:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:32:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:32:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:32:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:32:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:32:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:32:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:32:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:32:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 08:32:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:32:25,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248261617] [2024-10-24 08:32:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248261617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:32:25,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:32:25,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:32:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94111599] [2024-10-24 08:32:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:32:25,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:32:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:32:25,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:32:25,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:32:25,374 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 08:32:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:32:25,428 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-10-24 08:32:25,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:32:25,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-10-24 08:32:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:32:25,443 INFO L225 Difference]: With dead ends: 107 [2024-10-24 08:32:25,443 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 08:32:25,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:32:25,453 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:32:25,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:32:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 08:32:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 08:32:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 08:32:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2024-10-24 08:32:25,526 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 118 [2024-10-24 08:32:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:32:25,527 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2024-10-24 08:32:25,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 08:32:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2024-10-24 08:32:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 08:32:25,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:25,534 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:25,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:32:25,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2001789779, now seen corresponding path program 1 times [2024-10-24 08:32:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:32:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669665045] [2024-10-24 08:32:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:32:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:32:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:32:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:32:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:32:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:32:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:32:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:32:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:32:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:32:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:32:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:32:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:32:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:32:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:32:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:32:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:32:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:32:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:32:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:32:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 08:32:25,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:32:25,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669665045] [2024-10-24 08:32:25,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669665045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:32:25,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:32:25,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:32:25,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527308222] [2024-10-24 08:32:25,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:32:25,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:32:26,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:32:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:32:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:32:26,001 INFO L87 Difference]: Start difference. First operand 53 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 08:32:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:32:26,055 INFO L93 Difference]: Finished difference Result 157 states and 244 transitions. [2024-10-24 08:32:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:32:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 118 [2024-10-24 08:32:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:32:26,059 INFO L225 Difference]: With dead ends: 157 [2024-10-24 08:32:26,059 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 08:32:26,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:32:26,063 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:32:26,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 149 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:32:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 08:32:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-10-24 08:32:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 08:32:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2024-10-24 08:32:26,104 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 118 [2024-10-24 08:32:26,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:32:26,106 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2024-10-24 08:32:26,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 08:32:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2024-10-24 08:32:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 08:32:26,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:26,110 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:26,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:32:26,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:26,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:26,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1999942737, now seen corresponding path program 1 times [2024-10-24 08:32:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:32:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230992200] [2024-10-24 08:32:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:26,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:32:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:32:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:32:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:32:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:32:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:32:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:32:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:32:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:32:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:32:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:32:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:32:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:32:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:32:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:32:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:32:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:32:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:32:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 08:32:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:32:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 08:32:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:32:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230992200] [2024-10-24 08:32:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230992200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:32:26,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563255568] [2024-10-24 08:32:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:26,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:32:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:32:26,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:32:26,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:32:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:26,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:32:26,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:32:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-10-24 08:32:26,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:32:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 08:32:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563255568] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:32:27,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:32:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 08:32:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861303257] [2024-10-24 08:32:27,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:32:27,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:32:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:32:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:32:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:32:27,072 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:32:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:32:27,371 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2024-10-24 08:32:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:32:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 118 [2024-10-24 08:32:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:32:27,375 INFO L225 Difference]: With dead ends: 240 [2024-10-24 08:32:27,375 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 08:32:27,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:32:27,381 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:32:27,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 175 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:32:27,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 08:32:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2024-10-24 08:32:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 08:32:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2024-10-24 08:32:27,421 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 118 [2024-10-24 08:32:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:32:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2024-10-24 08:32:27,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 08:32:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2024-10-24 08:32:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:32:27,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:27,426 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:27,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:32:27,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:32:27,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:27,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1213914899, now seen corresponding path program 1 times [2024-10-24 08:32:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:32:27,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985733208] [2024-10-24 08:32:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:32:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:32:27,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:32:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:32:27,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:32:27,831 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:32:27,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:32:27,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:32:27,838 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 08:32:27,945 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:32:27,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:32:27 BoogieIcfgContainer [2024-10-24 08:32:27,952 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:32:27,953 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:32:27,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:32:27,953 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:32:27,954 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:32:24" (3/4) ... [2024-10-24 08:32:27,956 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:32:27,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:32:27,958 INFO L158 Benchmark]: Toolchain (without parser) took 4241.32ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 89.5MB in the beginning and 73.9MB in the end (delta: 15.6MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-10-24 08:32:27,958 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:32:27,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.23ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 130.1MB in the end (delta: -40.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-24 08:32:27,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.46ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 130.4MB in the end (delta: -403.9kB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-10-24 08:32:27,961 INFO L158 Benchmark]: Boogie Preprocessor took 62.44ms. Allocated memory is still 161.5MB. Free memory was 130.4MB in the beginning and 125.1MB in the end (delta: 5.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:32:27,961 INFO L158 Benchmark]: RCFGBuilder took 569.81ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 100.1MB in the end (delta: 25.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 08:32:27,961 INFO L158 Benchmark]: TraceAbstraction took 3180.24ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 99.0MB in the beginning and 73.9MB in the end (delta: 25.1MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2024-10-24 08:32:27,961 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 203.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:32:27,963 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.19ms. Allocated memory is still 161.5MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.23ms. Allocated memory is still 161.5MB. Free memory was 89.4MB in the beginning and 130.1MB in the end (delta: -40.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.46ms. Allocated memory is still 161.5MB. Free memory was 130.0MB in the beginning and 130.4MB in the end (delta: -403.9kB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.44ms. Allocated memory is still 161.5MB. Free memory was 130.4MB in the beginning and 125.1MB in the end (delta: 5.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 569.81ms. Allocated memory is still 161.5MB. Free memory was 125.1MB in the beginning and 100.1MB in the end (delta: 25.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3180.24ms. Allocated memory was 161.5MB in the beginning and 203.4MB in the end (delta: 41.9MB). Free memory was 99.0MB in the beginning and 73.9MB in the end (delta: 25.1MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 203.4MB. Free memory is still 73.9MB. 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 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] unsigned char last_1_var_1_1 = 2; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_20 = 0; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_15 = var_1_15 [L127] last_1_var_1_20 = var_1_20 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L104] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L107] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L110] var_1_12 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L111] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L121] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L138] RET updateVariables() [L139] CALL step() [L48] COND FALSE !(var_1_5 >= var_1_6) [L57] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L59] unsigned char stepLocal_1 = var_1_15; [L60] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L61] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L62] COND TRUE var_1_15 && stepLocal_1 [L63] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L68] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L77] COND TRUE var_1_11 == var_1_18 [L78] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=126, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L80] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=126, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L83] COND TRUE (var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5 [L84] var_1_9 = ((4.5f + var_1_11) - var_1_12) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=126, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L88] var_1_22 = var_1_12 [L89] var_1_23 = var_1_8 [L90] var_1_24 = var_1_6 [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=126, var_1_21=31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=126, var_1_21=31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 234 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 963 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3384/3420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:32:27,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.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 c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:32:30,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:32:30,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:32:30,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:32:30,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:32:30,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:32:30,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:32:30,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:32:30,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:32:30,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:32:30,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:32:30,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:32:30,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:32:30,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:32:30,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:32:30,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:32:30,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:32:30,375 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:32:30,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:32:30,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:32:30,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:32:30,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:32:30,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:32:30,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:32:30,380 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:32:30,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:32:30,380 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:32:30,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:32:30,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:32:30,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:32:30,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:32:30,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:32:30,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:32:30,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:32:30,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:32:30,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:32:30,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:32:30,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:32:30,382 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:32:30,383 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:32:30,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:32:30,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:32:30,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:32:30,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:32:30,385 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:32:30,386 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 -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2024-10-24 08:32:30,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:32:30,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:32:30,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:32:30,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:32:30,744 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:32:30,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i [2024-10-24 08:32:32,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:32:32,480 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:32:32,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i [2024-10-24 08:32:32,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d2bcc86/f3d0f6ac34224e80af564b3ce1ac731b/FLAG63aa17050 [2024-10-24 08:32:32,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50d2bcc86/f3d0f6ac34224e80af564b3ce1ac731b [2024-10-24 08:32:32,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:32:32,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:32:32,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:32:32,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:32:32,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:32:32,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:32:32" (1/1) ... [2024-10-24 08:32:32,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e3cb23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:32, skipping insertion in model container [2024-10-24 08:32:32,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:32:32" (1/1) ... [2024-10-24 08:32:32,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:32:33,069 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i[913,926] [2024-10-24 08:32:33,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:32:33,160 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:32:33,174 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-32.i[913,926] [2024-10-24 08:32:33,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:32:33,236 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:32:33,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33 WrapperNode [2024-10-24 08:32:33,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:32:33,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:32:33,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:32:33,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:32:33,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,295 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-10-24 08:32:33,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:32:33,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:32:33,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:32:33,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:32:33,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,330 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:32:33,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:32:33,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:32:33,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:32:33,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:32:33,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (1/1) ... [2024-10-24 08:32:33,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:32:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:32:33,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:32:33,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:32:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:32:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:32:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:32:33,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:32:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:32:33,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:32:33,557 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:32:33,560 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:32:36,008 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 08:32:36,008 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:32:36,088 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:32:36,089 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:32:36,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:32:36 BoogieIcfgContainer [2024-10-24 08:32:36,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:32:36,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:32:36,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:32:36,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:32:36,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:32:32" (1/3) ... [2024-10-24 08:32:36,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101fc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:32:36, skipping insertion in model container [2024-10-24 08:32:36,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:32:33" (2/3) ... [2024-10-24 08:32:36,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101fc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:32:36, skipping insertion in model container [2024-10-24 08:32:36,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:32:36" (3/3) ... [2024-10-24 08:32:36,100 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-32.i [2024-10-24 08:32:36,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:32:36,118 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:32:36,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:32:36,198 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;@341cc5fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:32:36,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:32:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 08:32:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 08:32:36,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:36,218 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:36,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:36,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1560032807, now seen corresponding path program 1 times [2024-10-24 08:32:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:32:36,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424860353] [2024-10-24 08:32:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:32:36,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:32:36,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:32:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:36,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:32:36,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:32:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-24 08:32:36,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:32:36,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:32:36,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424860353] [2024-10-24 08:32:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424860353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:32:36,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:32:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:32:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536404739] [2024-10-24 08:32:36,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:32:36,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:32:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:32:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:32:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:32:36,645 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 08:32:37,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:32:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:32:37,962 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-10-24 08:32:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:32:37,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-10-24 08:32:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:32:37,989 INFO L225 Difference]: With dead ends: 107 [2024-10-24 08:32:37,989 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 08:32:37,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:32:37,994 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:32:37,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 08:32:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 08:32:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 08:32:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 08:32:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2024-10-24 08:32:38,042 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 118 [2024-10-24 08:32:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:32:38,043 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2024-10-24 08:32:38,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 08:32:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2024-10-24 08:32:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 08:32:38,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:38,046 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:38,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:32:38,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:38,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:38,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2001789779, now seen corresponding path program 1 times [2024-10-24 08:32:38,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:32:38,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124577436] [2024-10-24 08:32:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:38,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:32:38,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:32:38,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:32:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:38,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 08:32:38,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:32:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-24 08:32:39,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:32:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 08:32:39,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:32:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124577436] [2024-10-24 08:32:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124577436] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:32:39,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:32:39,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-10-24 08:32:39,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908512801] [2024-10-24 08:32:39,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:32:39,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 08:32:39,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:32:39,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 08:32:39,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:32:39,433 INFO L87 Difference]: Start difference. First operand 53 states and 82 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-24 08:32:41,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:32:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:32:43,283 INFO L93 Difference]: Finished difference Result 264 states and 388 transitions. [2024-10-24 08:32:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-24 08:32:43,285 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 118 [2024-10-24 08:32:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:32:43,289 INFO L225 Difference]: With dead ends: 264 [2024-10-24 08:32:43,289 INFO L226 Difference]: Without dead ends: 212 [2024-10-24 08:32:43,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 08:32:43,292 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 295 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:32:43,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 412 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 08:32:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-24 08:32:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2024-10-24 08:32:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 119 states have internal predecessors, (149), 71 states have call successors, (71), 9 states have call predecessors, (71), 9 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-24 08:32:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-10-24 08:32:43,342 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 118 [2024-10-24 08:32:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:32:43,343 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-10-24 08:32:43,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-24 08:32:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-10-24 08:32:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:32:43,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:43,345 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:43,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:32:43,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:43,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1215761941, now seen corresponding path program 1 times [2024-10-24 08:32:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:32:43,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241195952] [2024-10-24 08:32:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:32:43,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:32:43,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:32:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:43,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 08:32:43,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:32:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 08:32:44,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:32:44,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:32:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241195952] [2024-10-24 08:32:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241195952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:32:44,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:32:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:32:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594029172] [2024-10-24 08:32:44,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:32:44,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:32:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:32:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:32:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:32:44,218 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 08:32:45,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:32:47,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 08:32:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:32:47,880 INFO L93 Difference]: Finished difference Result 551 states and 799 transitions. [2024-10-24 08:32:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:32:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-10-24 08:32:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:32:47,886 INFO L225 Difference]: With dead ends: 551 [2024-10-24 08:32:47,886 INFO L226 Difference]: Without dead ends: 375 [2024-10-24 08:32:47,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:32:47,888 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:32:47,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 08:32:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-24 08:32:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 312. [2024-10-24 08:32:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 187 states have (on average 1.2566844919786095) internal successors, (235), 188 states have internal predecessors, (235), 109 states have call successors, (109), 15 states have call predecessors, (109), 15 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-24 08:32:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 453 transitions. [2024-10-24 08:32:47,991 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 453 transitions. Word has length 119 [2024-10-24 08:32:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:32:47,992 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 453 transitions. [2024-10-24 08:32:47,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 08:32:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 453 transitions. [2024-10-24 08:32:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 08:32:47,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:32:47,996 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:32:48,009 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 (4)] Ended with exit code 0 [2024-10-24 08:32:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:48,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:32:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:32:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1213914899, now seen corresponding path program 1 times [2024-10-24 08:32:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:32:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538871294] [2024-10-24 08:32:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:32:48,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:32:48,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:32:48,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:32:48,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 08:32:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:32:48,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 08:32:48,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:00,769 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 08:33:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-24 08:33:01,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:27,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538871294] [2024-10-24 08:33:27,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538871294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:27,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432486415] [2024-10-24 08:33:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:33:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:33:27,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:33:27,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 08:33:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:27,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 08:33:27,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-24 08:33:35,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1432486415] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:47,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:33:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-24 08:33:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897231468] [2024-10-24 08:33:47,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:47,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 08:33:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 08:33:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=97, Unknown=1, NotChecked=0, Total=132 [2024-10-24 08:33:47,388 INFO L87 Difference]: Start difference. First operand 312 states and 453 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)