./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84fb807763dc27cc07c4eb904f96f1827807a04333a2bb10cab7c66605616f18 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:54:48,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:54:48,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:54:48,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:54:48,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:54:48,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:54:48,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:54:48,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:54:48,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:54:48,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:54:48,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:54:48,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:54:48,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:54:48,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:54:48,289 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:54:48,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:54:48,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:54:48,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:54:48,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:54:48,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:54:48,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:54:48,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:54:48,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:54:48,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:54:48,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:54:48,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:54:48,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:54:48,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:54:48,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:54:48,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:54:48,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:54:48,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:54:48,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:54:48,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:54:48,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:54:48,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:54:48,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:54:48,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:54:48,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:54:48,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:54:48,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:54:48,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:54:48,301 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84fb807763dc27cc07c4eb904f96f1827807a04333a2bb10cab7c66605616f18 [2024-10-11 12:54:48,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:54:48,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:54:48,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:54:48,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:54:48,523 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:54:48,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i [2024-10-11 12:54:49,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:54:50,046 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:54:50,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i [2024-10-11 12:54:50,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bc9d0fd5/cd0a3ac2fcdc404f8a16bd6e72693e20/FLAG68d6ee784 [2024-10-11 12:54:50,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2bc9d0fd5/cd0a3ac2fcdc404f8a16bd6e72693e20 [2024-10-11 12:54:50,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:54:50,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:54:50,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:54:50,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:54:50,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:54:50,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cdedae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50, skipping insertion in model container [2024-10-11 12:54:50,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:54:50,229 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i[915,928] [2024-10-11 12:54:50,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:54:50,281 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:54:50,290 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i[915,928] [2024-10-11 12:54:50,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:54:50,320 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:54:50,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50 WrapperNode [2024-10-11 12:54:50,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:54:50,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:54:50,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:54:50,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:54:50,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,406 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-11 12:54:50,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:54:50,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:54:50,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:54:50,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:54:50,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,459 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:54:50,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:54:50,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:54:50,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:54:50,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:54:50,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (1/1) ... [2024-10-11 12:54:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:54:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:54:50,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:54:50,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:54:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:54:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:54:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:54:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:54:50,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:54:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:54:50,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:54:50,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:54:50,874 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:54:50,875 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:54:50,915 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:54:50,915 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:54:50,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:50 BoogieIcfgContainer [2024-10-11 12:54:50,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:54:50,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:54:50,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:54:50,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:54:50,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:54:50" (1/3) ... [2024-10-11 12:54:50,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d15833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:54:50, skipping insertion in model container [2024-10-11 12:54:50,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:50" (2/3) ... [2024-10-11 12:54:50,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d15833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:54:50, skipping insertion in model container [2024-10-11 12:54:50,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:50" (3/3) ... [2024-10-11 12:54:50,923 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-41.i [2024-10-11 12:54:50,935 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:54:50,935 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:54:50,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:54:50,986 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;@5f2b383, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:54:50,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:54:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:54:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 12:54:50,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:50,997 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:50,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:51,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1359678171, now seen corresponding path program 1 times [2024-10-11 12:54:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:54:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084901420] [2024-10-11 12:54:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:54:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:54:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:54:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:54:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:54:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:54:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:54:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:54:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:54:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:54:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:54:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:54:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:54:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:54:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:54:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:54:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084901420] [2024-10-11 12:54:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084901420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:54:51,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:54:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:54:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879535206] [2024-10-11 12:54:51,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:54:51,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:54:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:54:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:54:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:54:51,332 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:54:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:54:51,373 INFO L93 Difference]: Finished difference Result 91 states and 155 transitions. [2024-10-11 12:54:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:54:51,376 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-11 12:54:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:54:51,382 INFO L225 Difference]: With dead ends: 91 [2024-10-11 12:54:51,384 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 12:54:51,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:54:51,391 INFO L432 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:54:51,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:54:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 12:54:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 12:54:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:54:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-11 12:54:51,434 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 88 [2024-10-11 12:54:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:54:51,435 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-11 12:54:51,438 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:54:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-11 12:54:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 12:54:51,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:51,441 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:51,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:54:51,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:51,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash 444968675, now seen corresponding path program 1 times [2024-10-11 12:54:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:54:51,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575871458] [2024-10-11 12:54:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:54:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:54:51,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355621001] [2024-10-11 12:54:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:51,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:54:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:54:51,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:54:51,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:54:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:51,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 12:54:51,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:54:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:54:52,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:55:19,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:55:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575871458] [2024-10-11 12:55:19,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 12:55:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355621001] [2024-10-11 12:55:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355621001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:55:19,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:55:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 12:55:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128567827] [2024-10-11 12:55:19,871 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 12:55:19,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:55:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:55:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:55:19,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=125, Unknown=6, NotChecked=0, Total=182 [2024-10-11 12:55:19,875 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:55:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:55:26,766 INFO L93 Difference]: Finished difference Result 157 states and 219 transitions. [2024-10-11 12:55:26,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 12:55:26,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-11 12:55:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:55:26,769 INFO L225 Difference]: With dead ends: 157 [2024-10-11 12:55:26,769 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 12:55:26,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=215, Invalid=535, Unknown=6, NotChecked=0, Total=756 [2024-10-11 12:55:26,774 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 79 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:55:26,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 281 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 12:55:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 12:55:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 57. [2024-10-11 12:55:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:55:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-10-11 12:55:26,829 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 88 [2024-10-11 12:55:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:55:26,834 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-10-11 12:55:26,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:55:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-10-11 12:55:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 12:55:26,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:55:26,839 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:55:26,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:55:27,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:55:27,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:55:27,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:55:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -364377951, now seen corresponding path program 1 times [2024-10-11 12:55:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:55:27,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499525871] [2024-10-11 12:55:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:55:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:55:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:55:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008770385] [2024-10-11 12:55:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:55:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:55:27,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:55:27,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:55:27,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:55:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:55:27,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 12:55:27,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:55:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:55:29,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:55:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:55:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499525871] [2024-10-11 12:55:48,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 12:55:48,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008770385] [2024-10-11 12:55:48,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008770385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:55:48,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:55:48,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 12:55:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97212774] [2024-10-11 12:55:48,908 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 12:55:48,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:55:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:55:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:55:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=127, Unknown=4, NotChecked=0, Total=182 [2024-10-11 12:55:48,909 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:55:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:55:55,669 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2024-10-11 12:55:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 12:55:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-11 12:55:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:55:55,676 INFO L225 Difference]: With dead ends: 169 [2024-10-11 12:55:55,676 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 12:55:55,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=189, Invalid=457, Unknown=4, NotChecked=0, Total=650 [2024-10-11 12:55:55,677 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 91 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:55:55,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 316 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-11 12:55:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 12:55:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 53. [2024-10-11 12:55:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:55:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-10-11 12:55:55,694 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 88 [2024-10-11 12:55:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:55:55,695 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-10-11 12:55:55,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:55:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-10-11 12:55:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:55:55,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:55:55,699 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:55:55,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:55:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:55:55,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:55:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:55:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash 909208767, now seen corresponding path program 1 times [2024-10-11 12:55:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:55:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999565763] [2024-10-11 12:55:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:55:55,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:55:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:55:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833737945] [2024-10-11 12:55:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:55:55,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:55:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:55:55,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:55:55,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 12:55:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:55:56,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:55:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:55:56,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:55:56,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:55:56,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:55:56,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 12:55:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:55:56,674 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 12:55:56,731 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:55:56,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:55:56 BoogieIcfgContainer [2024-10-11 12:55:56,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:55:56,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:55:56,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:55:56,734 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:55:56,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:50" (3/4) ... [2024-10-11 12:55:56,736 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:55:56,737 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:55:56,737 INFO L158 Benchmark]: Toolchain (without parser) took 66665.29ms. Allocated memory is still 182.5MB. Free memory was 117.5MB in the beginning and 85.3MB in the end (delta: 32.2MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2024-10-11 12:55:56,738 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:55:56,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.31ms. Allocated memory is still 182.5MB. Free memory was 117.3MB in the beginning and 102.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:55:56,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.59ms. Allocated memory is still 182.5MB. Free memory was 102.6MB in the beginning and 154.1MB in the end (delta: -51.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-10-11 12:55:56,738 INFO L158 Benchmark]: Boogie Preprocessor took 59.33ms. Allocated memory is still 182.5MB. Free memory was 154.1MB in the beginning and 148.5MB in the end (delta: 5.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:55:56,739 INFO L158 Benchmark]: RCFGBuilder took 429.93ms. Allocated memory is still 182.5MB. Free memory was 148.5MB in the beginning and 124.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 12:55:56,739 INFO L158 Benchmark]: TraceAbstraction took 65815.85ms. Allocated memory is still 182.5MB. Free memory was 124.0MB in the beginning and 86.3MB in the end (delta: 37.7MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-10-11 12:55:56,739 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 182.5MB. Free memory was 86.3MB in the beginning and 85.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:55:56,740 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.12ms. Allocated memory is still 109.1MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.31ms. Allocated memory is still 182.5MB. Free memory was 117.3MB in the beginning and 102.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.59ms. Allocated memory is still 182.5MB. Free memory was 102.6MB in the beginning and 154.1MB in the end (delta: -51.5MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.33ms. Allocated memory is still 182.5MB. Free memory was 154.1MB in the beginning and 148.5MB in the end (delta: 5.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.93ms. Allocated memory is still 182.5MB. Free memory was 148.5MB in the beginning and 124.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65815.85ms. Allocated memory is still 182.5MB. Free memory was 124.0MB in the beginning and 86.3MB in the end (delta: 37.7MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 182.5MB. Free memory was 86.3MB in the beginning and 85.3MB in the end (delta: 1.0MB). 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 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] unsigned char last_1_var_1_15 = 8; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] last_1_var_1_15 = var_1_15 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L87] var_1_4 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L88] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L90] var_1_5 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L91] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L93] var_1_11 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L94] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L95] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L96] var_1_12 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L97] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L98] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L99] var_1_14 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L100] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L101] var_1_16 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L102] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L103] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L104] var_1_18 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L106] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] RET updateVariables() [L121] CALL step() [L42] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L43] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L50] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L55] var_1_22 = 1 [L56] var_1_23 = var_1_22 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=0, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L57] COND TRUE (- var_1_13) > 31.9f [L58] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=8, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L62] COND TRUE \read(var_1_1) [L63] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L65] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L66] COND TRUE var_1_15 > stepLocal_0 [L67] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L69] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=1, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=2, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L70] COND TRUE var_1_1 || stepLocal_2 [L71] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L75] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L76] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-49152, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L79] COND FALSE !(! (var_1_17 <= var_1_17)) [L82] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L121] RET step() [L122] CALL, EXPR property() [L112-L113] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=8, var_1_12=8, var_1_13=8/5, var_1_15=254, var_1_16=254, var_1_17=16638, var_1_18=-49152, var_1_1=1, var_1_20=8, var_1_22=1, var_1_23=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.7s, OverallIterations: 4, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 660 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 231 mSDtfsCounter, 1014 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 50.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 41, 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, 116 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 49.7s InterpolantComputationTime, 618 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 8 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 930/936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:55:56,952 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 12:55:57,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 84fb807763dc27cc07c4eb904f96f1827807a04333a2bb10cab7c66605616f18 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:55:58,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:55:58,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:55:58,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:55:58,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:55:58,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:55:58,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:55:58,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:55:58,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:55:58,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:55:58,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:55:58,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:55:58,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:55:58,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:55:58,947 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:55:58,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:55:58,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:55:58,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:55:58,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:55:58,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:55:58,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:55:58,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:55:58,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:55:58,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:55:58,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:55:58,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:55:58,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:55:58,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:55:58,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:55:58,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:55:58,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:55:58,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:55:58,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:55:58,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:55:58,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:55:58,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:55:58,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:55:58,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:55:58,954 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:55:58,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:55:58,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:55:58,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:55:58,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:55:58,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:55:58,956 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:55:58,956 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 84fb807763dc27cc07c4eb904f96f1827807a04333a2bb10cab7c66605616f18 [2024-10-11 12:55:59,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:55:59,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:55:59,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:55:59,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:55:59,258 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:55:59,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i [2024-10-11 12:56:00,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:56:00,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:56:00,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i [2024-10-11 12:56:00,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/659bdc999/f0fa1c0e7bb049d9a0d3641d7c576caf/FLAG7f5ca9c44 [2024-10-11 12:56:00,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/659bdc999/f0fa1c0e7bb049d9a0d3641d7c576caf [2024-10-11 12:56:00,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:56:00,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:56:00,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:56:00,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:56:00,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:56:00,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:56:00" (1/1) ... [2024-10-11 12:56:00,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1134bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:00, skipping insertion in model container [2024-10-11 12:56:00,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:56:00" (1/1) ... [2024-10-11 12:56:01,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:56:01,276 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i[915,928] [2024-10-11 12:56:01,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:56:01,382 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:56:01,404 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-41.i[915,928] [2024-10-11 12:56:01,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:56:01,484 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:56:01,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01 WrapperNode [2024-10-11 12:56:01,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:56:01,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:56:01,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:56:01,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:56:01,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,565 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-11 12:56:01,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:56:01,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:56:01,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:56:01,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:56:01,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,629 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:56:01,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:56:01,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:56:01,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:56:01,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:56:01,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (1/1) ... [2024-10-11 12:56:01,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:56:01,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:56:01,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:56:01,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:56:01,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:56:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:56:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:56:01,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:56:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:56:01,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:56:01,824 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:56:01,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:56:05,247 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:56:05,247 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:56:05,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:56:05,283 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:56:05,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:56:05 BoogieIcfgContainer [2024-10-11 12:56:05,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:56:05,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:56:05,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:56:05,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:56:05,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:56:00" (1/3) ... [2024-10-11 12:56:05,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b76615e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:56:05, skipping insertion in model container [2024-10-11 12:56:05,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:56:01" (2/3) ... [2024-10-11 12:56:05,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b76615e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:56:05, skipping insertion in model container [2024-10-11 12:56:05,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:56:05" (3/3) ... [2024-10-11 12:56:05,299 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-41.i [2024-10-11 12:56:05,311 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:56:05,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:56:05,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:56:05,373 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;@27ddfa49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:56:05,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:56:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:56:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 12:56:05,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:56:05,385 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:56:05,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:56:05,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:56:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1359678171, now seen corresponding path program 1 times [2024-10-11 12:56:05,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:56:05,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367160813] [2024-10-11 12:56:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:56:05,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:56:05,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:56:05,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:56:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:56:05,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:56:05,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:56:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-11 12:56:05,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:56:05,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:56:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367160813] [2024-10-11 12:56:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367160813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:56:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:56:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:56:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731427109] [2024-10-11 12:56:05,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:56:05,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:56:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:56:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:56:05,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:56:05,751 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:56:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:56:06,531 INFO L93 Difference]: Finished difference Result 91 states and 155 transitions. [2024-10-11 12:56:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:56:06,556 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-11 12:56:06,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:56:06,565 INFO L225 Difference]: With dead ends: 91 [2024-10-11 12:56:06,565 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 12:56:06,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:56:06,571 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:56:06,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 12:56:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 12:56:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 12:56:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:56:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-11 12:56:06,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 88 [2024-10-11 12:56:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:56:06,603 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-11 12:56:06,603 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:56:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-11 12:56:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 12:56:06,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:56:06,607 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:56:06,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:56:06,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:06,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:56:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:56:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 444968675, now seen corresponding path program 1 times [2024-10-11 12:56:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:56:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936539962] [2024-10-11 12:56:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:56:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:56:06,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:56:06,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:56:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:56:07,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:56:07,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:56:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:56:07,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:56:07,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:56:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936539962] [2024-10-11 12:56:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936539962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:56:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:56:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:56:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882608888] [2024-10-11 12:56:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:56:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:56:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:56:07,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:56:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:56:07,741 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:56:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:56:11,977 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2024-10-11 12:56:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:56:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-10-11 12:56:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:56:11,980 INFO L225 Difference]: With dead ends: 132 [2024-10-11 12:56:11,980 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 12:56:11,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 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-11 12:56:11,982 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:56:11,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 114 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 12:56:11,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 12:56:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-10-11 12:56:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:56:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2024-10-11 12:56:11,997 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 88 [2024-10-11 12:56:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:56:11,998 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2024-10-11 12:56:11,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:56:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2024-10-11 12:56:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 12:56:11,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:56:12,000 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:56:12,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:56:12,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:12,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:56:12,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:56:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1146033253, now seen corresponding path program 1 times [2024-10-11 12:56:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:56:12,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032165835] [2024-10-11 12:56:12,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:56:12,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:56:12,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:56:12,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:56:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:56:12,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 12:56:12,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:56:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:56:12,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:56:12,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:56:12,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032165835] [2024-10-11 12:56:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032165835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:56:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:56:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 12:56:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248829100] [2024-10-11 12:56:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:56:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 12:56:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:56:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 12:56:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:56:12,990 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:56:15,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:56:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:56:16,222 INFO L93 Difference]: Finished difference Result 189 states and 263 transitions. [2024-10-11 12:56:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 12:56:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-11 12:56:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:56:16,247 INFO L225 Difference]: With dead ends: 189 [2024-10-11 12:56:16,247 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 12:56:16,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:56:16,250 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:56:16,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 168 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 12:56:16,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 12:56:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2024-10-11 12:56:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:56:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2024-10-11 12:56:16,271 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 88 [2024-10-11 12:56:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:56:16,271 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2024-10-11 12:56:16,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:56:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2024-10-11 12:56:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:56:16,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:56:16,273 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:56:16,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 12:56:16,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:16,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:56:16,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:56:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1167374205, now seen corresponding path program 1 times [2024-10-11 12:56:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:56:16,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583725421] [2024-10-11 12:56:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:56:16,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:56:16,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:56:16,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:56:16,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:56:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:56:16,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 12:56:16,931 INFO L278 TraceCheckSpWp]: Computing forward predicates...