./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:56:36,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:56:36,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:56:36,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:56:36,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:56:36,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:56:36,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:56:36,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:56:36,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:56:36,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:56:36,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:56:36,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:56:36,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:56:36,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:56:36,181 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:56:36,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:56:36,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:56:36,182 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:56:36,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:56:36,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:56:36,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:56:36,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:56:36,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:56:36,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:56:36,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:56:36,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:56:36,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:56:36,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:56:36,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:56:36,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:56:36,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:56:36,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:56:36,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:36,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:56:36,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:56:36,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:56:36,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:56:36,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:56:36,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:56:36,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:56:36,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:56:36,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:56:36,188 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2024-11-08 19:56:36,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:56:36,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:56:36,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:56:36,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:56:36,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:56:36,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-08 19:56:37,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:56:38,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:56:38,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-08 19:56:38,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6611736/b955384eeccf44b0a1587083bbce134d/FLAG4b234c97c [2024-11-08 19:56:38,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be6611736/b955384eeccf44b0a1587083bbce134d [2024-11-08 19:56:38,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:56:38,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:56:38,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:38,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:56:38,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:56:38,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764ad196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38, skipping insertion in model container [2024-11-08 19:56:38,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:56:38,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-08 19:56:38,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:38,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:56:38,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-08 19:56:38,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:38,443 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:56:38,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38 WrapperNode [2024-11-08 19:56:38,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:38,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:38,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:56:38,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:56:38,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,497 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-08 19:56:38,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:38,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:56:38,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:56:38,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:56:38,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:56:38,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:56:38,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:56:38,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:56:38,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:56:38,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (1/1) ... [2024-11-08 19:56:38,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:38,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:38,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:56:38,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:56:38,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:56:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:56:38,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:56:38,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:56:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:56:38,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:56:38,704 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:56:38,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:56:38,925 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 19:56:38,925 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:56:38,939 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:56:38,940 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:56:38,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:38 BoogieIcfgContainer [2024-11-08 19:56:38,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:56:38,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:56:38,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:56:38,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:56:38,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:56:38" (1/3) ... [2024-11-08 19:56:38,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f42bf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:38, skipping insertion in model container [2024-11-08 19:56:38,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:38" (2/3) ... [2024-11-08 19:56:38,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f42bf87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:38, skipping insertion in model container [2024-11-08 19:56:38,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:38" (3/3) ... [2024-11-08 19:56:38,947 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-08 19:56:38,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:56:38,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:56:39,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:56:39,020 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;@679035ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:56:39,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:56:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 19:56:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 19:56:39,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:39,053 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:39,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:39,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1402951041, now seen corresponding path program 1 times [2024-11-08 19:56:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925447839] [2024-11-08 19:56:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:56:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:56:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:56:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:56:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:56:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:56:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:56:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925447839] [2024-11-08 19:56:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925447839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:39,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:39,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:56:39,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104988923] [2024-11-08 19:56:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:39,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:56:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:39,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:56:39,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:39,541 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:56:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:39,581 INFO L93 Difference]: Finished difference Result 117 states and 201 transitions. [2024-11-08 19:56:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:56:39,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-08 19:56:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:39,630 INFO L225 Difference]: With dead ends: 117 [2024-11-08 19:56:39,630 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 19:56:39,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:39,640 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:39,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:56:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 19:56:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 19:56:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 19:56:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-11-08 19:56:39,728 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2024-11-08 19:56:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:39,729 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-11-08 19:56:39,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:56:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-11-08 19:56:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 19:56:39,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:39,732 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:39,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:56:39,732 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:39,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:39,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1225521275, now seen corresponding path program 1 times [2024-11-08 19:56:39,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:39,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517267799] [2024-11-08 19:56:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:56:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:56:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:56:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:56:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:56:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:56:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:56:40,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517267799] [2024-11-08 19:56:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517267799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:56:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626217252] [2024-11-08 19:56:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:40,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:56:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:56:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:40,084 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:56:40,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:40,120 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2024-11-08 19:56:40,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:56:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 123 [2024-11-08 19:56:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:40,123 INFO L225 Difference]: With dead ends: 168 [2024-11-08 19:56:40,123 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 19:56:40,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:40,125 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:40,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 160 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:56:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 19:56:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-08 19:56:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 19:56:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2024-11-08 19:56:40,154 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 123 [2024-11-08 19:56:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:40,154 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2024-11-08 19:56:40,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:56:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2024-11-08 19:56:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 19:56:40,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:40,156 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:40,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:56:40,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 549486087, now seen corresponding path program 1 times [2024-11-08 19:56:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024287587] [2024-11-08 19:56:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:56:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:56:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:56:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:56:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:56:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:56:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:56:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:56:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:56:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:56:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:56:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:56:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 19:56:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:56:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:56:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:56:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 19:56:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:56:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 19:56:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 19:56:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:56:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024287587] [2024-11-08 19:56:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024287587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:56:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387040167] [2024-11-08 19:56:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:56:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:40,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:56:40,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:56:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:40,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 19:56:40,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-08 19:56:40,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:56:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 19:56:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387040167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:56:40,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:56:40,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 19:56:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651461850] [2024-11-08 19:56:40,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:56:40,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:56:40,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:56:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:56:40,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:56:40,938 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:56:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:41,320 INFO L93 Difference]: Finished difference Result 255 states and 381 transitions. [2024-11-08 19:56:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:56:41,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 123 [2024-11-08 19:56:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:41,323 INFO L225 Difference]: With dead ends: 255 [2024-11-08 19:56:41,323 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 19:56:41,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:56:41,328 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:41,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 219 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:56:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 19:56:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2024-11-08 19:56:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 85 states have internal predecessors, (104), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 19:56:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-08 19:56:41,365 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 123 [2024-11-08 19:56:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:41,366 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-08 19:56:41,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:56:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-08 19:56:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 19:56:41,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:41,369 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:41,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:56:41,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:56:41,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:41,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:41,571 INFO L85 PathProgramCache]: Analyzing trace with hash -219419195, now seen corresponding path program 1 times [2024-11-08 19:56:41,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:56:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352698189] [2024-11-08 19:56:41,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:56:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:56:41,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:56:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:56:41,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:56:41,850 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:56:41,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:56:41,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:56:41,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:56:41,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:56:41,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:56:41 BoogieIcfgContainer [2024-11-08 19:56:41,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:56:41,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:56:41,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:56:41,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:56:41,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:38" (3/4) ... [2024-11-08 19:56:41,964 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:56:41,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:56:41,966 INFO L158 Benchmark]: Toolchain (without parser) took 3842.54ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 77.7MB in the beginning and 145.7MB in the end (delta: -68.0MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,966 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 103.4MB in the end (delta: 159.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:56:41,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.03ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 77.6MB in the beginning and 213.6MB in the end (delta: -136.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 249.6MB. Free memory was 213.6MB in the beginning and 210.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,967 INFO L158 Benchmark]: Boogie Preprocessor took 60.95ms. Allocated memory is still 249.6MB. Free memory was 210.4MB in the beginning and 205.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,967 INFO L158 Benchmark]: RCFGBuilder took 380.49ms. Allocated memory is still 249.6MB. Free memory was 205.2MB in the beginning and 184.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,967 INFO L158 Benchmark]: TraceAbstraction took 3019.36ms. Allocated memory is still 249.6MB. Free memory was 183.2MB in the beginning and 145.7MB in the end (delta: 37.5MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,967 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 249.6MB. Free memory was 145.7MB in the beginning and 145.7MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:56:41,969 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.65ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 103.4MB in the end (delta: 159.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.03ms. Allocated memory was 151.0MB in the beginning and 249.6MB in the end (delta: 98.6MB). Free memory was 77.6MB in the beginning and 213.6MB in the end (delta: -136.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 249.6MB. Free memory was 213.6MB in the beginning and 210.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.95ms. Allocated memory is still 249.6MB. Free memory was 210.4MB in the beginning and 205.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 380.49ms. Allocated memory is still 249.6MB. Free memory was 205.2MB in the beginning and 184.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3019.36ms. Allocated memory is still 249.6MB. Free memory was 183.2MB in the beginning and 145.7MB in the end (delta: 37.5MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 249.6MB. Free memory was 145.7MB in the beginning and 145.7MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] unsigned char last_1_var_1_1 = 2; [L43] unsigned char last_1_var_1_15 = 1; [L44] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L125] last_1_var_1_1 = var_1_1 [L126] last_1_var_1_15 = var_1_15 [L127] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L137] RET updateLastVariables() [L138] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L94] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_8=32, var_1_9=201/2] [L104] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_9=201/2] [L107] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L110] var_1_12 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L111] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L118] var_1_19 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L121] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L138] RET updateVariables() [L139] CALL step() [L48] COND FALSE !(var_1_5 >= var_1_6) [L57] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L59] unsigned char stepLocal_1 = var_1_15; [L60] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L61] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L62] COND TRUE var_1_15 && stepLocal_1 [L63] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L68] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L77] COND TRUE var_1_11 == var_1_18 [L78] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L80] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L83] COND TRUE (var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5 [L84] var_1_9 = ((4.5f + var_1_11) - var_1_12) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L88] var_1_22 = var_1_12 [L89] var_1_23 = var_1_8 [L90] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=64, var_1_21=-31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_4=-40609, var_1_5=32, var_1_6=64, var_1_7=64, var_1_8=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 466 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 258 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 616 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 610 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3384/3420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:56:41,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:56:44,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:56:44,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:56:44,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:56:44,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:56:44,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:56:44,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:56:44,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:56:44,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:56:44,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:56:44,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:56:44,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:56:44,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:56:44,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:56:44,121 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:56:44,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:56:44,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:56:44,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:56:44,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:56:44,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:56:44,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:56:44,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:56:44,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:56:44,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:56:44,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:56:44,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:56:44,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:56:44,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:56:44,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:44,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:56:44,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:56:44,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:56:44,129 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:56:44,129 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:56:44,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:56:44,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:56:44,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:56:44,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:56:44,131 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c35ab03f4f4f78ac1af608465bb57e10aa6da013cafc0cae47ddeca5b98a94fb [2024-11-08 19:56:44,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:56:44,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:56:44,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:56:44,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:56:44,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:56:44,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-08 19:56:46,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:56:46,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:56:46,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-08 19:56:46,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a6c6516/814b554572c942f7b786e22bed6774d7/FLAG3cd218b15 [2024-11-08 19:56:46,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a6c6516/814b554572c942f7b786e22bed6774d7 [2024-11-08 19:56:46,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:56:46,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:56:46,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:46,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:56:46,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:56:46,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68314b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46, skipping insertion in model container [2024-11-08 19:56:46,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:56:46,624 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-08 19:56:46,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:46,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:56:46,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-32.i[913,926] [2024-11-08 19:56:46,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:56:46,755 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:56:46,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46 WrapperNode [2024-11-08 19:56:46,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:56:46,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:46,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:56:46,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:56:46,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,797 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-08 19:56:46,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:56:46,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:56:46,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:56:46,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:56:46,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:56:46,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:56:46,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:56:46,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:56:46,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:56:46,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (1/1) ... [2024-11-08 19:56:46,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:56:46,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:56:46,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:56:46,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:56:46,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:56:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:56:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:56:46,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:56:46,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:56:46,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:56:46,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:56:46,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:56:49,571 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 19:56:49,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:56:49,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:56:49,587 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:56:49,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:49 BoogieIcfgContainer [2024-11-08 19:56:49,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:56:49,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:56:49,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:56:49,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:56:49,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:56:46" (1/3) ... [2024-11-08 19:56:49,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3145611c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:49, skipping insertion in model container [2024-11-08 19:56:49,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:56:46" (2/3) ... [2024-11-08 19:56:49,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3145611c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:56:49, skipping insertion in model container [2024-11-08 19:56:49,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:56:49" (3/3) ... [2024-11-08 19:56:49,598 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-32.i [2024-11-08 19:56:49,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:56:49,627 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:56:49,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:56:49,694 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;@318af0d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:56:49,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:56:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 19:56:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 19:56:49,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:49,712 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:49,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1402951041, now seen corresponding path program 1 times [2024-11-08 19:56:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:56:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635696603] [2024-11-08 19:56:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:49,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:49,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:56:49,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:56:49,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:56:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:50,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:56:50,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-08 19:56:50,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:56:50,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:56:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635696603] [2024-11-08 19:56:50,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635696603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:50,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:56:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369997376] [2024-11-08 19:56:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:50,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:56:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:56:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:56:50,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:50,169 INFO L87 Difference]: Start difference. First operand has 62 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:56:50,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:50,228 INFO L93 Difference]: Finished difference Result 117 states and 201 transitions. [2024-11-08 19:56:50,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:56:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-08 19:56:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:50,248 INFO L225 Difference]: With dead ends: 117 [2024-11-08 19:56:50,251 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 19:56:50,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:56:50,263 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:50,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:56:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 19:56:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 19:56:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 19:56:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-11-08 19:56:50,357 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 123 [2024-11-08 19:56:50,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:50,358 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-11-08 19:56:50,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 19:56:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-11-08 19:56:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 19:56:50,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:50,374 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:50,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:56:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:50,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:50,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:50,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1225521275, now seen corresponding path program 1 times [2024-11-08 19:56:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:56:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785837594] [2024-11-08 19:56:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:56:50,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:56:50,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:56:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:50,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:56:50,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-08 19:56:51,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:56:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 19:56:51,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:56:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785837594] [2024-11-08 19:56:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785837594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:56:51,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:56:51,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-11-08 19:56:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035009215] [2024-11-08 19:56:51,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:56:51,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:56:51,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:56:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:56:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:56:51,375 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 19:56:53,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:56:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:54,718 INFO L93 Difference]: Finished difference Result 279 states and 403 transitions. [2024-11-08 19:56:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-08 19:56:54,719 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 123 [2024-11-08 19:56:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:54,722 INFO L225 Difference]: With dead ends: 279 [2024-11-08 19:56:54,722 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 19:56:54,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 19:56:54,733 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 322 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:54,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 630 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 19:56:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 19:56:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 211. [2024-11-08 19:56:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 131 states have internal predecessors, (161), 71 states have call successors, (71), 9 states have call predecessors, (71), 9 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-08 19:56:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2024-11-08 19:56:54,823 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 123 [2024-11-08 19:56:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:54,824 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2024-11-08 19:56:54,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-11-08 19:56:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2024-11-08 19:56:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 19:56:54,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:54,826 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:54,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:56:55,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:55,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:55,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1994426557, now seen corresponding path program 1 times [2024-11-08 19:56:55,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:56:55,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025184518] [2024-11-08 19:56:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:56:55,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:56:55,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:56:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:56:55,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:56:55,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:56:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 19:56:55,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:56:55,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:56:55,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025184518] [2024-11-08 19:56:55,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025184518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:56:55,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:56:55,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:56:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183329882] [2024-11-08 19:56:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:56:55,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:56:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:56:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:56:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:56:55,635 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:56:57,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:56:59,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:56:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:56:59,545 INFO L93 Difference]: Finished difference Result 581 states and 829 transitions. [2024-11-08 19:56:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:56:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-08 19:56:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:56:59,571 INFO L225 Difference]: With dead ends: 581 [2024-11-08 19:56:59,572 INFO L226 Difference]: Without dead ends: 396 [2024-11-08 19:56:59,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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-11-08 19:56:59,578 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:56:59,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 19:56:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-08 19:56:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 330. [2024-11-08 19:56:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 206 states have internal predecessors, (253), 109 states have call successors, (109), 15 states have call predecessors, (109), 15 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2024-11-08 19:56:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 471 transitions. [2024-11-08 19:56:59,679 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 471 transitions. Word has length 124 [2024-11-08 19:56:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:56:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 471 transitions. [2024-11-08 19:56:59,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 19:56:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 471 transitions. [2024-11-08 19:56:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 19:56:59,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:56:59,684 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:56:59,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 19:56:59,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:59,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:56:59,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:56:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -219419195, now seen corresponding path program 1 times [2024-11-08 19:56:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:56:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12907049] [2024-11-08 19:56:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:56:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:56:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:56:59,897 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:56:59,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 19:57:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:57:00,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 19:57:00,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:57:14,924 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 19:57:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 368 proven. 42 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-08 19:57:15,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:57:44,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:57:44,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12907049] [2024-11-08 19:57:44,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12907049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:57:44,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [159691004] [2024-11-08 19:57:44,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:57:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 19:57:44,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 19:57:44,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 19:57:44,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 19:57:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:57:45,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 19:57:45,259 INFO L278 TraceCheckSpWp]: Computing forward predicates...