./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:27:13,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:27:13,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:27:13,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:27:13,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:27:13,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:27:13,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:27:13,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:27:13,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:27:13,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:27:13,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:27:13,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:27:13,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:27:13,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:27:13,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:27:13,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:27:13,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:27:13,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:27:13,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:27:13,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:27:13,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:27:13,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:27:13,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:27:13,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:27:13,916 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:27:13,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:27:13,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:27:13,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:27:13,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:27:13,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:27:13,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:27:13,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:27:13,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:13,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:27:13,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:27:13,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:27:13,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:27:13,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:27:13,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:27:13,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:27:13,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:27:13,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:27:13,923 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2024-10-11 09:27:14,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:27:14,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:27:14,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:27:14,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:27:14,226 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:27:14,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-10-11 09:27:15,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:27:16,020 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:27:16,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-10-11 09:27:16,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/36af1c06e/f19488ce0b8343aeb84c25dbcb3beb1e/FLAG1db8e2ee3 [2024-10-11 09:27:16,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/36af1c06e/f19488ce0b8343aeb84c25dbcb3beb1e [2024-10-11 09:27:16,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:27:16,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:27:16,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:16,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:27:16,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:27:16,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bad4c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16, skipping insertion in model container [2024-10-11 09:27:16,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:27:16,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-10-11 09:27:16,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:16,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:27:16,363 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-10-11 09:27:16,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:16,420 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:27:16,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16 WrapperNode [2024-10-11 09:27:16,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:16,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:16,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:27:16,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:27:16,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,480 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-11 09:27:16,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:16,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:27:16,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:27:16,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:27:16,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,515 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:27:16,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:27:16,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:27:16,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:27:16,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:27:16,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (1/1) ... [2024-10-11 09:27:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:16,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:27:16,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:27:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:27:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:27:16,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:27:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:27:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:27:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:27:16,744 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:27:16,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:27:17,152 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 09:27:17,153 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:27:17,187 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:27:17,188 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:27:17,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:17 BoogieIcfgContainer [2024-10-11 09:27:17,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:27:17,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:27:17,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:27:17,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:27:17,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:27:16" (1/3) ... [2024-10-11 09:27:17,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7d3e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:17, skipping insertion in model container [2024-10-11 09:27:17,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:16" (2/3) ... [2024-10-11 09:27:17,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7d3e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:17, skipping insertion in model container [2024-10-11 09:27:17,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:17" (3/3) ... [2024-10-11 09:27:17,200 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-10-11 09:27:17,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:27:17,219 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:27:17,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:27:17,300 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;@4e5ea3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:27:17,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:27:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 09:27:17,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:17,323 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:17,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash -928636005, now seen corresponding path program 1 times [2024-10-11 09:27:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87265781] [2024-10-11 09:27:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:27:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:27:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:27:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:27:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:27:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:27:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:27:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:27:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:27:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:27:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:27:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:27:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:27:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:27:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:27:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:27:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:27:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:27:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:17,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87265781] [2024-10-11 09:27:18,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87265781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:18,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:18,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:27:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618986108] [2024-10-11 09:27:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:18,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:27:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:18,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:27:18,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:18,040 INFO L87 Difference]: Start difference. First operand has 84 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:27:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:18,097 INFO L93 Difference]: Finished difference Result 164 states and 292 transitions. [2024-10-11 09:27:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:27:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167 [2024-10-11 09:27:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:18,113 INFO L225 Difference]: With dead ends: 164 [2024-10-11 09:27:18,113 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 09:27:18,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:18,124 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:18,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:27:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 09:27:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 09:27:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2024-10-11 09:27:18,191 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 167 [2024-10-11 09:27:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:18,191 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2024-10-11 09:27:18,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:27:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2024-10-11 09:27:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 09:27:18,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:18,199 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:18,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:27:18,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:18,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1390988839, now seen corresponding path program 1 times [2024-10-11 09:27:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:18,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880806395] [2024-10-11 09:27:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:27:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:27:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:27:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:27:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:27:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:27:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:27:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:27:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:27:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:27:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:27:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:27:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:27:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:27:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:27:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:27:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:27:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:27:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:18,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:18,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880806395] [2024-10-11 09:27:18,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880806395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:18,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:18,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:27:18,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123148125] [2024-10-11 09:27:18,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:27:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:18,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:27:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:27:18,898 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:19,000 INFO L93 Difference]: Finished difference Result 241 states and 379 transitions. [2024-10-11 09:27:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:27:19,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-10-11 09:27:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:19,005 INFO L225 Difference]: With dead ends: 241 [2024-10-11 09:27:19,005 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 09:27:19,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:27:19,008 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 71 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:19,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 353 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:27:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 09:27:19,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-10-11 09:27:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:27:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2024-10-11 09:27:19,049 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 167 [2024-10-11 09:27:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:19,050 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-10-11 09:27:19,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2024-10-11 09:27:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 09:27:19,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:19,056 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:19,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:27:19,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:19,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash 131397406, now seen corresponding path program 1 times [2024-10-11 09:27:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:19,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482744788] [2024-10-11 09:27:19,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:19,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:27:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:27:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:27:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:27:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:27:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:27:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:27:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:27:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:27:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:27:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:27:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:27:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:27:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:27:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:27:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:27:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:27:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:27:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:19,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482744788] [2024-10-11 09:27:19,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482744788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:19,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:27:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497883006] [2024-10-11 09:27:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:19,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:27:19,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:27:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:27:19,530 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:19,948 INFO L93 Difference]: Finished difference Result 453 states and 703 transitions. [2024-10-11 09:27:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:27:19,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-11 09:27:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:19,955 INFO L225 Difference]: With dead ends: 453 [2024-10-11 09:27:19,955 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 09:27:19,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:27:19,960 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 109 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:19,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 493 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:27:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 09:27:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2024-10-11 09:27:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 193 states have internal predecessors, (261), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-11 09:27:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 449 transitions. [2024-10-11 09:27:20,037 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 449 transitions. Word has length 168 [2024-10-11 09:27:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:20,038 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 449 transitions. [2024-10-11 09:27:20,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 449 transitions. [2024-10-11 09:27:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 09:27:20,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:20,040 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:20,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:27:20,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:20,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash -686251044, now seen corresponding path program 1 times [2024-10-11 09:27:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:20,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290236787] [2024-10-11 09:27:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:27:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:27:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:27:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:27:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:27:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 09:27:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:27:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:27:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:27:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:27:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:27:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:27:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:27:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:27:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:27:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:27:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:27:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:27:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:27:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:27:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:27:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:27:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:27:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290236787] [2024-10-11 09:27:20,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290236787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:20,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:27:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945963229] [2024-10-11 09:27:20,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:27:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:27:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:27:20,376 INFO L87 Difference]: Start difference. First operand 291 states and 449 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:20,553 INFO L93 Difference]: Finished difference Result 449 states and 698 transitions. [2024-10-11 09:27:20,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:27:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-11 09:27:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:20,562 INFO L225 Difference]: With dead ends: 449 [2024-10-11 09:27:20,563 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 09:27:20,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:27:20,565 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 125 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:20,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 169 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:27:20,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 09:27:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-10-11 09:27:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 193 states have (on average 1.3626943005181347) internal successors, (263), 195 states have internal predecessors, (263), 94 states have call successors, (94), 5 states have call predecessors, (94), 5 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-11 09:27:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 451 transitions. [2024-10-11 09:27:20,602 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 451 transitions. Word has length 168 [2024-10-11 09:27:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 451 transitions. [2024-10-11 09:27:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 451 transitions. [2024-10-11 09:27:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 09:27:20,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:20,604 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:20,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:27:20,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:20,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1100584818, now seen corresponding path program 1 times [2024-10-11 09:27:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462132290] [2024-10-11 09:27:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:27:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644763196] [2024-10-11 09:27:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:27:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:20,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:27:20,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:27:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:21,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:27:21,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 805 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-11 09:27:22,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:27:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 09:27:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462132290] [2024-10-11 09:27:22,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:27:22,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644763196] [2024-10-11 09:27:22,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644763196] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:27:22,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:27:22,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 16 [2024-10-11 09:27:22,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792002243] [2024-10-11 09:27:22,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:27:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 09:27:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 09:27:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:27:22,639 INFO L87 Difference]: Start difference. First operand 293 states and 451 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-10-11 09:27:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:24,190 INFO L93 Difference]: Finished difference Result 912 states and 1358 transitions. [2024-10-11 09:27:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 09:27:24,191 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 169 [2024-10-11 09:27:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:24,197 INFO L225 Difference]: With dead ends: 912 [2024-10-11 09:27:24,198 INFO L226 Difference]: Without dead ends: 694 [2024-10-11 09:27:24,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 09:27:24,201 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 534 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:24,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 508 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 09:27:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-11 09:27:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 614. [2024-10-11 09:27:24,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 423 states have (on average 1.3498817966903074) internal successors, (571), 429 states have internal predecessors, (571), 174 states have call successors, (174), 16 states have call predecessors, (174), 16 states have return successors, (174), 168 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-11 09:27:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 919 transitions. [2024-10-11 09:27:24,293 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 919 transitions. Word has length 169 [2024-10-11 09:27:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:24,294 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 919 transitions. [2024-10-11 09:27:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2024-10-11 09:27:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 919 transitions. [2024-10-11 09:27:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 09:27:24,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:24,297 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:24,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:27:24,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:27:24,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash 674422544, now seen corresponding path program 1 times [2024-10-11 09:27:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699446460] [2024-10-11 09:27:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:27:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929968060] [2024-10-11 09:27:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:27:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:24,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:27:24,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:27:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:27:25,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:27:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:27:25,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:27:25,610 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:27:25,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:27:25,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:27:25,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:27:25,821 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 09:27:25,955 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:27:25,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:27:25 BoogieIcfgContainer [2024-10-11 09:27:25,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:27:25,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:27:25,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:27:25,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:27:25,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:17" (3/4) ... [2024-10-11 09:27:25,962 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:27:25,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:27:25,964 INFO L158 Benchmark]: Toolchain (without parser) took 9913.96ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 125.3MB in the beginning and 140.5MB in the end (delta: -15.2MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2024-10-11 09:27:25,964 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:27:25,965 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.26ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 108.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:27:25,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.37ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 104.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:27:25,967 INFO L158 Benchmark]: Boogie Preprocessor took 67.19ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 99.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:27:25,967 INFO L158 Benchmark]: RCFGBuilder took 638.74ms. Allocated memory is still 159.4MB. Free memory was 99.3MB in the beginning and 69.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 09:27:25,968 INFO L158 Benchmark]: TraceAbstraction took 8767.40ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 68.7MB in the beginning and 141.5MB in the end (delta: -72.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:27:25,968 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 232.8MB. Free memory was 141.5MB in the beginning and 140.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 09:27:25,970 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.26ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 108.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.37ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 104.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.19ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 99.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 638.74ms. Allocated memory is still 159.4MB. Free memory was 99.3MB in the beginning and 69.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8767.40ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 68.7MB in the beginning and 141.5MB in the end (delta: -72.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 232.8MB. Free memory was 141.5MB in the beginning and 140.5MB in the end (delta: 1.1MB). 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 177, overapproximation of shiftRight at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L42] signed short int var_1_23 = 128; [L43] unsigned short int var_1_25 = 32; [L44] unsigned char var_1_29 = 1; [L45] unsigned long int var_1_31 = 0; [L46] unsigned char var_1_32 = 1; [L47] unsigned short int var_1_33 = 1000; [L48] signed char var_1_38 = 25; [L49] unsigned short int var_1_39 = 200; [L50] unsigned char var_1_43 = 10; [L51] unsigned char var_1_47 = 0; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] FCALL updateLastVariables() [L185] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=0, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L136] var_1_3 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L138] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L139] var_1_4 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L140] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L141] var_1_5 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L142] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L143] var_1_6 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L144] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_7=316/5, var_1_8=1] [L145] var_1_7 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L146] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L147] var_1_11 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L149] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L151] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L152] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L154] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L156] var_1_16 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L157] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L158] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L160] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L161] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L164] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1000, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L165] var_1_33 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L166] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] CALL assume_abort_if_not(var_1_33 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L167] RET assume_abort_if_not(var_1_33 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L168] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=200, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L169] var_1_39 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L170] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_39 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L171] RET assume_abort_if_not(var_1_39 <= 65535) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L172] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L185] RET updateVariables() [L186] CALL step() [L55] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L56] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=0, var_1_8=1] [L58] var_1_47 = var_1_11 [L59] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=0, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-4294967280, var_1_8=1] [L60] COND TRUE var_1_11 >= var_1_21 [L61] var_1_31 = ((((var_1_21) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? (var_1_21) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=10, var_1_47=-4294967280, var_1_8=1] [L63] COND TRUE ((((var_1_21) < (var_1_33)) ? (var_1_21) : (var_1_33))) < (var_1_39 + var_1_11) [L64] var_1_43 = ((((var_1_11) < ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) ? (var_1_11) : ((((((100 + var_1_11)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((100 + var_1_11)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=16, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L66] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L67] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L67] COND FALSE !((var_1_21 + var_1_12) > (2u >> var_1_11)) [L74] COND FALSE !(var_1_11 < var_1_11) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L79] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L90] unsigned char stepLocal_1 = var_1_14; [L91] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L92] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L93] COND TRUE stepLocal_1 || var_1_14 [L94] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=1] [L101] COND FALSE !(var_1_6 > (- var_1_7)) [L106] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=128, var_1_23=128, var_1_25=32, var_1_29=1, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L108] var_1_22 = var_1_8 [L109] var_1_23 = var_1_12 [L110] var_1_29 = var_1_19 VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L111] COND FALSE !(var_1_12 < (~ (var_1_12 / var_1_33))) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L120] COND FALSE !(var_1_12 < (var_1_12 / var_1_33)) [L123] var_1_32 = ((! var_1_19) && var_1_15) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L126] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L177-L178] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=-4294967280, var_1_12=-4294967280, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=-4294967280, var_1_21=8, var_1_22=16, var_1_23=16, var_1_25=32, var_1_29=0, var_1_2=1, var_1_31=16, var_1_32=1, var_1_33=1, var_1_38=25, var_1_39=1, var_1_3=1, var_1_43=-4294967280, var_1_47=-4294967280, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 839 mSDsluCounter, 1647 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1037 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 920 IncrementalHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 610 mSDtfsCounter, 920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=614occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 90 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1346 NumberOfCodeBlocks, 1346 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 3111 SizeOfPredicates, 5 NumberOfNonLiveVariables, 382 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 7737/7800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:27:26,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:27:28,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:27:28,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:27:28,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:27:28,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:27:28,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:27:28,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:27:28,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:27:28,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:27:28,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:27:28,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:27:28,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:27:28,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:27:28,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:27:28,431 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:27:28,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:27:28,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:27:28,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:27:28,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:27:28,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:27:28,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:27:28,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:27:28,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:27:28,436 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:27:28,436 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:27:28,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:27:28,436 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:27:28,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:27:28,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:27:28,437 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:27:28,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:27:28,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:27:28,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:27:28,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:27:28,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:28,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:27:28,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:27:28,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:27:28,440 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:27:28,440 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:27:28,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:27:28,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:27:28,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:27:28,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:27:28,442 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:27:28,442 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b198c2e9899cdd18ef24e3a73621a4aef3e13c5394aa42c7346238e62ac07c4d [2024-10-11 09:27:28,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:27:28,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:27:28,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:27:28,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:27:28,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:27:28,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-10-11 09:27:30,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:27:30,719 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:27:30,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-10-11 09:27:30,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/386a0ce96/1781f3670a314dbeaa216212b317b42f/FLAGb7c2170a6 [2024-10-11 09:27:31,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/386a0ce96/1781f3670a314dbeaa216212b317b42f [2024-10-11 09:27:31,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:27:31,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:27:31,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:31,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:27:31,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:27:31,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd13833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31, skipping insertion in model container [2024-10-11 09:27:31,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:27:31,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-10-11 09:27:31,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:31,444 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:27:31,456 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i[919,932] [2024-10-11 09:27:31,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:31,536 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:27:31,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31 WrapperNode [2024-10-11 09:27:31,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:31,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:31,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:27:31,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:27:31,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,606 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-11 09:27:31,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:31,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:27:31,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:27:31,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:27:31,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,648 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:27:31,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:27:31,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:27:31,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:27:31,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:27:31,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (1/1) ... [2024-10-11 09:27:31,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:31,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:31,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:27:31,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:27:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:27:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:27:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:27:31,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:27:31,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:27:31,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:27:31,877 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:27:31,879 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:27:39,679 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:27:39,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:27:39,734 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:27:39,735 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:27:39,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:39 BoogieIcfgContainer [2024-10-11 09:27:39,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:27:39,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:27:39,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:27:39,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:27:39,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:27:31" (1/3) ... [2024-10-11 09:27:39,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdb33d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:39, skipping insertion in model container [2024-10-11 09:27:39,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:31" (2/3) ... [2024-10-11 09:27:39,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fdb33d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:39, skipping insertion in model container [2024-10-11 09:27:39,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:39" (3/3) ... [2024-10-11 09:27:39,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-27.i [2024-10-11 09:27:39,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:27:39,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:27:39,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:27:39,858 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;@611513ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:27:39,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:27:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 09:27:39,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:39,874 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:39,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1664657991, now seen corresponding path program 1 times [2024-10-11 09:27:39,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:27:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520878996] [2024-10-11 09:27:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:39,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:27:39,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:27:39,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:27:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:40,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:27:40,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-11 09:27:40,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:27:40,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:27:40,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520878996] [2024-10-11 09:27:40,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520878996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:40,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:40,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:27:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693547791] [2024-10-11 09:27:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:40,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:27:40,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:27:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:27:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:40,477 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:27:43,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:43,529 INFO L93 Difference]: Finished difference Result 148 states and 268 transitions. [2024-10-11 09:27:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:27:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-11 09:27:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:43,569 INFO L225 Difference]: With dead ends: 148 [2024-10-11 09:27:43,569 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 09:27:43,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:43,575 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:43,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 09:27:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 09:27:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 09:27:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-11 09:27:43,625 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 164 [2024-10-11 09:27:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:43,626 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-11 09:27:43,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:27:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-11 09:27:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 09:27:43,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:43,633 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:43,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:27:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:43,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1877403075, now seen corresponding path program 1 times [2024-10-11 09:27:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:27:43,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684392139] [2024-10-11 09:27:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:43,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:43,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:27:43,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:27:43,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:27:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:27:44,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-10-11 09:27:45,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:27:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:46,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:27:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684392139] [2024-10-11 09:27:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684392139] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:27:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:27:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 09:27:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639651384] [2024-10-11 09:27:46,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:46,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:27:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:27:46,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:27:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:27:46,055 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:50,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:50,736 INFO L93 Difference]: Finished difference Result 147 states and 222 transitions. [2024-10-11 09:27:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:27:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-11 09:27:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:50,743 INFO L225 Difference]: With dead ends: 147 [2024-10-11 09:27:50,744 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 09:27:50,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:27:50,746 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 55 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:50,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 142 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 09:27:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 09:27:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 09:27:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2024-10-11 09:27:50,776 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 164 [2024-10-11 09:27:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:50,776 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2024-10-11 09:27:50,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2024-10-11 09:27:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 09:27:50,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:50,790 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:50,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 09:27:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:50,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 303170293, now seen corresponding path program 1 times [2024-10-11 09:27:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:27:50,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657361029] [2024-10-11 09:27:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:50,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:50,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:27:50,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:27:50,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 09:27:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:51,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:27:51,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:52,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:27:52,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:27:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657361029] [2024-10-11 09:27:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657361029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:27:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709539263] [2024-10-11 09:27:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:52,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:27:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:27:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:27:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:27:52,557 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:56,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:00,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:02,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:28:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:28:02,602 INFO L93 Difference]: Finished difference Result 226 states and 334 transitions. [2024-10-11 09:28:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:28:02,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-11 09:28:02,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:28:02,606 INFO L225 Difference]: With dead ends: 226 [2024-10-11 09:28:02,606 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 09:28:02,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:28:02,608 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 24 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:28:02,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 302 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2024-10-11 09:28:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 09:28:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2024-10-11 09:28:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 90 states have internal predecessors, (112), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:28:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 216 transitions. [2024-10-11 09:28:02,636 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 216 transitions. Word has length 165 [2024-10-11 09:28:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:28:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 216 transitions. [2024-10-11 09:28:02,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:28:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 216 transitions. [2024-10-11 09:28:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 09:28:02,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:28:02,639 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:28:02,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:28:02,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:28:02,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:28:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:28:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1492350447, now seen corresponding path program 1 times [2024-10-11 09:28:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:28:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186680290] [2024-10-11 09:28:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:02,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:28:02,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:28:02,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:28:02,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 09:28:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:03,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:28:03,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:28:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 46 proven. 576 refuted. 0 times theorem prover too weak. 678 trivial. 0 not checked. [2024-10-11 09:28:08,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:28:08,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:28:08,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186680290] [2024-10-11 09:28:08,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186680290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:28:08,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1794364680] [2024-10-11 09:28:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:28:08,939 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:28:08,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:28:08,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:28:08,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 09:28:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:28:10,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 09:28:10,044 INFO L278 TraceCheckSpWp]: Computing forward predicates...