./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:26:13,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:26:13,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:26:13,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:26:13,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:26:13,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:26:13,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:26:13,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:26:13,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:26:13,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:26:13,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:26:13,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:26:13,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:26:13,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:26:13,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:26:13,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:26:13,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:26:13,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:26:13,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:26:13,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:26:13,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:26:13,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:26:13,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:26:13,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:26:13,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:26:13,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:26:13,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:26:13,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:26:13,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:26:13,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:26:13,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:26:13,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:26:13,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:26:13,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:26:13,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:26:13,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:26:13,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:26:13,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:26:13,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:26:13,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:26:13,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:26:13,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:26:13,779 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 [2024-11-16 14:26:14,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:26:14,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:26:14,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:26:14,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:26:14,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:26:14,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2024-11-16 14:26:15,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:26:15,656 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:26:15,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2024-11-16 14:26:15,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e6be6a5/a757c8deced141dd9b67d8461ad5a986/FLAG83a8087c0 [2024-11-16 14:26:15,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e6be6a5/a757c8deced141dd9b67d8461ad5a986 [2024-11-16 14:26:15,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:26:15,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:26:15,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:26:15,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:26:15,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:26:15,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:26:15" (1/1) ... [2024-11-16 14:26:15,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67dfb841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:15, skipping insertion in model container [2024-11-16 14:26:15,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:26:15" (1/1) ... [2024-11-16 14:26:15,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:26:15,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i[919,932] [2024-11-16 14:26:15,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:26:15,953 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:26:15,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i[919,932] [2024-11-16 14:26:15,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:26:16,008 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:26:16,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16 WrapperNode [2024-11-16 14:26:16,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:26:16,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:26:16,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:26:16,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:26:16,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,067 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-16 14:26:16,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:26:16,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:26:16,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:26:16,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:26:16,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,106 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:26:16,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:26:16,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:26:16,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:26:16,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:26:16,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (1/1) ... [2024-11-16 14:26:16,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:26:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:26:16,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:26:16,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:26:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:26:16,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:26:16,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:26:16,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:26:16,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:26:16,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:26:16,309 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:26:16,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:26:16,774 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 14:26:16,778 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:26:16,796 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:26:16,796 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:26:16,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:26:16 BoogieIcfgContainer [2024-11-16 14:26:16,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:26:16,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:26:16,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:26:16,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:26:16,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:26:15" (1/3) ... [2024-11-16 14:26:16,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79617834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:26:16, skipping insertion in model container [2024-11-16 14:26:16,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:16" (2/3) ... [2024-11-16 14:26:16,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79617834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:26:16, skipping insertion in model container [2024-11-16 14:26:16,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:26:16" (3/3) ... [2024-11-16 14:26:16,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2024-11-16 14:26:16,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:26:16,822 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:26:16,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:26:16,882 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;@3bf60a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:26:16,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:26:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 14:26:16,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:16,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:16,896 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:16,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:16,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -501352340, now seen corresponding path program 1 times [2024-11-16 14:26:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:26:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909093784] [2024-11-16 14:26:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:26:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:26:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:26:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:26:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 14:26:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:26:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:26:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:26:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:26:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:26:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:26:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:26:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:26:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:26:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:26:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:26:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 14:26:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:26:17,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909093784] [2024-11-16 14:26:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909093784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:26:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:26:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:26:17,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665838917] [2024-11-16 14:26:17,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:26:17,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:26:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:26:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:26:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:26:17,334 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 14:26:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:17,369 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2024-11-16 14:26:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:26:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-11-16 14:26:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:17,384 INFO L225 Difference]: With dead ends: 140 [2024-11-16 14:26:17,384 INFO L226 Difference]: Without dead ends: 69 [2024-11-16 14:26:17,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:26:17,392 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:17,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:26:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-16 14:26:17,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-16 14:26:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 14:26:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-16 14:26:17,443 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 111 [2024-11-16 14:26:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:17,445 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-16 14:26:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 14:26:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-16 14:26:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:17,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:17,451 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:17,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:26:17,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:17,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1720989807, now seen corresponding path program 1 times [2024-11-16 14:26:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:26:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099400763] [2024-11-16 14:26:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:26:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:26:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:26:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:26:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 14:26:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:26:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:26:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:26:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:26:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:26:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:26:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:26:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:26:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:26:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:26:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:26:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 14:26:17,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:26:17,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099400763] [2024-11-16 14:26:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099400763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:26:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:26:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:26:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71165295] [2024-11-16 14:26:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:26:17,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:26:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:26:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:26:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:26:17,738 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:17,819 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2024-11-16 14:26:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:26:17,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 14:26:17,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:17,821 INFO L225 Difference]: With dead ends: 180 [2024-11-16 14:26:17,821 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 14:26:17,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:26:17,825 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 62 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:17,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 206 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:26:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 14:26:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-11-16 14:26:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 14:26:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2024-11-16 14:26:17,852 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 111 [2024-11-16 14:26:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 163 transitions. [2024-11-16 14:26:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 163 transitions. [2024-11-16 14:26:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:17,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:17,858 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:26:17,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1932340720, now seen corresponding path program 1 times [2024-11-16 14:26:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:26:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341372273] [2024-11-16 14:26:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:26:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:26:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:26:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:26:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 14:26:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:26:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:26:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:26:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:26:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:26:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:26:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:26:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:26:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:26:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:26:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:26:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 14:26:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:26:18,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341372273] [2024-11-16 14:26:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341372273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:26:18,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:26:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:26:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906999290] [2024-11-16 14:26:18,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:26:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:26:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:26:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:26:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:26:18,440 INFO L87 Difference]: Start difference. First operand 110 states and 163 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:18,618 INFO L93 Difference]: Finished difference Result 324 states and 467 transitions. [2024-11-16 14:26:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:26:18,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 14:26:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:18,623 INFO L225 Difference]: With dead ends: 324 [2024-11-16 14:26:18,624 INFO L226 Difference]: Without dead ends: 217 [2024-11-16 14:26:18,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-11-16 14:26:18,628 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 190 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:18,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 366 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:26:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-16 14:26:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2024-11-16 14:26:18,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.358974358974359) internal successors, (159), 117 states have internal predecessors, (159), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:26:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-11-16 14:26:18,663 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 111 [2024-11-16 14:26:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:18,663 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-11-16 14:26:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-11-16 14:26:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:18,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:18,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:18,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:26:18,668 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:18,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:18,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2061423439, now seen corresponding path program 1 times [2024-11-16 14:26:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:26:18,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107728321] [2024-11-16 14:26:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:26:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:26:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:26:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:26:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 14:26:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:26:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:26:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:26:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:26:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:26:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:26:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:26:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:26:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:26:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:26:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:26:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 14:26:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:26:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107728321] [2024-11-16 14:26:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107728321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:26:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064697092] [2024-11-16 14:26:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:19,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:26:19,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:26:19,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:26:19,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:26:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:19,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:26:19,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:26:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-16 14:26:19,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:26:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 14:26:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064697092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:26:19,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:26:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 14:26:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417742397] [2024-11-16 14:26:19,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:26:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:26:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:26:19,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:26:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:26:19,585 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 14:26:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:19,761 INFO L93 Difference]: Finished difference Result 293 states and 415 transitions. [2024-11-16 14:26:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:26:19,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 111 [2024-11-16 14:26:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:19,765 INFO L225 Difference]: With dead ends: 293 [2024-11-16 14:26:19,768 INFO L226 Difference]: Without dead ends: 144 [2024-11-16 14:26:19,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:26:19,769 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 184 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:19,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 189 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:26:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-16 14:26:19,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2024-11-16 14:26:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 103 states have internal predecessors, (133), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:26:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2024-11-16 14:26:19,791 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 111 [2024-11-16 14:26:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:19,792 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2024-11-16 14:26:19,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 14:26:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2024-11-16 14:26:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 14:26:19,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:19,794 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:19,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 14:26:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:26:19,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1143441797, now seen corresponding path program 1 times [2024-11-16 14:26:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:26:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673912399] [2024-11-16 14:26:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:26:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:20,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:26:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 14:26:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:20,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 14:26:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:20,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 14:26:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 14:26:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 14:26:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:26:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:26:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:26:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:26:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:26:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 14:26:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:26:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 14:26:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:26:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 14:26:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:26:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673912399] [2024-11-16 14:26:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673912399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:26:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400216398] [2024-11-16 14:26:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:21,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:26:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:26:21,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:26:21,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 14:26:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:21,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 14:26:21,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:26:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 173 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-16 14:26:22,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:26:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-16 14:26:24,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400216398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:26:24,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:26:24,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 14] total 32 [2024-11-16 14:26:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209403995] [2024-11-16 14:26:24,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:26:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 14:26:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:26:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 14:26:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2024-11-16 14:26:24,980 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand has 32 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 30 states have internal predecessors, (111), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2024-11-16 14:26:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:34,310 INFO L93 Difference]: Finished difference Result 1107 states and 1462 transitions. [2024-11-16 14:26:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-16 14:26:34,316 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 30 states have internal predecessors, (111), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) Word has length 112 [2024-11-16 14:26:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:34,325 INFO L225 Difference]: With dead ends: 1107 [2024-11-16 14:26:34,328 INFO L226 Difference]: Without dead ends: 970 [2024-11-16 14:26:34,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3985 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2487, Invalid=9285, Unknown=0, NotChecked=0, Total=11772 [2024-11-16 14:26:34,340 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1221 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 3415 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 3415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:34,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 2332 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 3415 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-16 14:26:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-16 14:26:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 563. [2024-11-16 14:26:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 402 states have (on average 1.2114427860696517) internal successors, (487), 405 states have internal predecessors, (487), 123 states have call successors, (123), 37 states have call predecessors, (123), 37 states have return successors, (123), 120 states have call predecessors, (123), 123 states have call successors, (123) [2024-11-16 14:26:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 733 transitions. [2024-11-16 14:26:34,458 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 733 transitions. Word has length 112 [2024-11-16 14:26:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:34,459 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 733 transitions. [2024-11-16 14:26:34,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 30 states have internal predecessors, (111), 8 states have call successors, (45), 4 states have call predecessors, (45), 8 states have return successors, (45), 8 states have call predecessors, (45), 8 states have call successors, (45) [2024-11-16 14:26:34,459 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 733 transitions. [2024-11-16 14:26:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 14:26:34,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:34,461 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:34,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:26:34,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:26:34,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1798215802, now seen corresponding path program 1 times [2024-11-16 14:26:34,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:26:34,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941844680] [2024-11-16 14:26:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:34,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:26:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:26:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995790280] [2024-11-16 14:26:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:34,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:26:34,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:26:34,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:26:34,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 14:26:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:26:35,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:26:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:26:35,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:26:35,497 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:26:35,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:26:35,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 14:26:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:26:35,705 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 14:26:35,804 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:26:35,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:26:35 BoogieIcfgContainer [2024-11-16 14:26:35,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:26:35,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:26:35,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:26:35,808 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:26:35,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:26:16" (3/4) ... [2024-11-16 14:26:35,811 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:26:35,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:26:35,813 INFO L158 Benchmark]: Toolchain (without parser) took 20130.96ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 112.2MB in the beginning and 202.3MB in the end (delta: -90.1MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-16 14:26:35,813 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:26:35,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.10ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 94.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 14:26:35,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.90ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 90.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:26:35,814 INFO L158 Benchmark]: Boogie Preprocessor took 60.90ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 84.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:26:35,815 INFO L158 Benchmark]: IcfgBuilder took 666.62ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 84.9MB in the beginning and 185.2MB in the end (delta: -100.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-16 14:26:35,816 INFO L158 Benchmark]: TraceAbstraction took 19006.94ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 184.2MB in the beginning and 202.3MB in the end (delta: -18.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-16 14:26:35,816 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 268.4MB. Free memory is still 202.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:26:35,817 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.18ms. Allocated memory is still 167.8MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.10ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 94.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.90ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 90.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.90ms. Allocated memory is still 167.8MB. Free memory was 90.7MB in the beginning and 84.9MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 666.62ms. Allocated memory was 167.8MB in the beginning and 222.3MB in the end (delta: 54.5MB). Free memory was 84.9MB in the beginning and 185.2MB in the end (delta: -100.3MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19006.94ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 184.2MB in the beginning and 202.3MB in the end (delta: -18.1MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 268.4MB. Free memory is still 202.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_31 = 1; [L40] unsigned long int var_1_33 = 2; [L41] unsigned short int var_1_34 = 0; [L42] signed short int var_1_35 = -10; [L43] unsigned char var_1_40 = 2; [L44] unsigned short int var_1_42 = 8; [L45] unsigned long int var_1_44 = 1249494912; [L46] double last_1_var_1_1 = 5.05; [L47] unsigned short int last_1_var_1_9 = 1; [L48] unsigned long int last_1_var_1_11 = 8; [L49] unsigned char last_1_var_1_14 = 32; [L50] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_11 = var_1_11 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L124] var_1_6 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L125] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L126] var_1_7 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L127] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L128] var_1_8 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L129] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L130] var_1_13 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L131] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L136] var_1_16 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L139] var_1_17 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L142] var_1_19 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L145] var_1_44 = __VERIFIER_nondet_ulong() [L146] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L146] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=2, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] COND TRUE \read(var_1_13) [L55] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L59] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L68] COND TRUE var_1_9 >= (~ var_1_15) [L69] var_1_40 = var_1_17 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L71] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L72] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L76] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L77] COND FALSE !(var_1_18 >= stepLocal_0) [L80] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L82] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L83] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L84] COND FALSE !(var_1_18 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L94] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L95] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L97] COND TRUE \read(var_1_20) [L98] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND FALSE !((var_1_9 <= var_1_17) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] var_1_33 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L112] COND TRUE ((var_1_6 - var_1_6) + var_1_8) == var_1_6 [L113] var_1_35 = var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L115] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L116] COND TRUE ((((var_1_11) < (var_1_15)) ? (var_1_11) : (var_1_15))) > var_1_14 [L117] var_1_21 = (((((((((var_1_14) < (0)) ? (var_1_14) : (0))) + var_1_17)) < (16)) ? ((((((var_1_14) < (0)) ? (var_1_14) : (0))) + var_1_17)) : (16))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L119] COND TRUE var_1_9 > (- var_1_17) [L120] var_1_31 = (var_1_13 && var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=1, var_1_16=-256, var_1_17=0, var_1_18=8589934581, var_1_19=8589934590, var_1_1=2, var_1_20=1, var_1_21=0, var_1_27=1, var_1_31=1, var_1_33=0, var_1_34=4, var_1_35=8, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1690 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1657 mSDsluCounter, 3194 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2529 mSDsCounter, 619 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3614 IncrementalHoareTripleChecker+Invalid, 4233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 619 mSolverCounterUnsat, 665 mSDtfsCounter, 3614 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 610 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3986 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=563occurred in iteration=5, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 480 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 1003 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 993 ConstructedInterpolants, 0 QuantifiedInterpolants, 6114 SizeOfPredicates, 8 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 3645/3780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 14:26:35,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:26:38,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:26:38,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:26:38,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:26:38,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:26:38,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:26:38,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:26:38,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:26:38,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:26:38,344 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:26:38,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:26:38,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:26:38,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:26:38,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:26:38,346 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:26:38,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:26:38,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:26:38,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:26:38,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:26:38,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:26:38,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:26:38,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:26:38,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:26:38,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:26:38,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:26:38,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:26:38,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:26:38,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:26:38,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:26:38,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:26:38,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:26:38,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:26:38,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:26:38,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:26:38,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:26:38,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:26:38,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:26:38,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:26:38,360 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:26:38,360 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:26:38,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:26:38,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:26:38,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:26:38,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:26:38,362 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f42b3e590c3342934300a63742dfb4f9c28cfc7e02ac6f0af20972824a6c5c3 [2024-11-16 14:26:38,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:26:38,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:26:38,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:26:38,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:26:38,730 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:26:38,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2024-11-16 14:26:40,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:26:40,593 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:26:40,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2024-11-16 14:26:40,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c6fe9fc/e540e572a4ab4cd8a37336d6eaca2a41/FLAG447469506 [2024-11-16 14:26:40,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67c6fe9fc/e540e572a4ab4cd8a37336d6eaca2a41 [2024-11-16 14:26:40,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:26:40,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:26:40,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:26:40,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:26:40,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:26:40,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:26:40" (1/1) ... [2024-11-16 14:26:40,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a57308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:40, skipping insertion in model container [2024-11-16 14:26:40,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:26:40" (1/1) ... [2024-11-16 14:26:40,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:26:40,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i[919,932] [2024-11-16 14:26:40,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:26:40,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:26:40,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i[919,932] [2024-11-16 14:26:41,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:26:41,063 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:26:41,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41 WrapperNode [2024-11-16 14:26:41,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:26:41,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:26:41,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:26:41,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:26:41,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,140 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-16 14:26:41,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:26:41,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:26:41,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:26:41,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:26:41,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,183 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:26:41,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,193 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:26:41,206 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:26:41,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:26:41,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:26:41,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (1/1) ... [2024-11-16 14:26:41,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:26:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:26:41,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:26:41,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:26:41,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:26:41,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:26:41,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:26:41,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:26:41,395 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:26:41,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:26:46,276 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 14:26:46,276 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:26:46,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:26:46,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:26:46,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:26:46 BoogieIcfgContainer [2024-11-16 14:26:46,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:26:46,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:26:46,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:26:46,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:26:46,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:26:40" (1/3) ... [2024-11-16 14:26:46,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62846597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:26:46, skipping insertion in model container [2024-11-16 14:26:46,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:26:41" (2/3) ... [2024-11-16 14:26:46,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62846597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:26:46, skipping insertion in model container [2024-11-16 14:26:46,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:26:46" (3/3) ... [2024-11-16 14:26:46,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-70.i [2024-11-16 14:26:46,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:26:46,318 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:26:46,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:26:46,391 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;@3402ea89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:26:46,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:26:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 14:26:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:46,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:46,406 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:46,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:46,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1262576224, now seen corresponding path program 1 times [2024-11-16 14:26:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:26:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779009203] [2024-11-16 14:26:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:46,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:46,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:26:46,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:26:46,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 14:26:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:46,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:26:46,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:26:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-16 14:26:46,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:26:46,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:26:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779009203] [2024-11-16 14:26:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779009203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:26:46,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:26:46,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:26:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305332037] [2024-11-16 14:26:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:26:47,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:26:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:26:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:26:47,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:26:47,028 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:47,055 INFO L93 Difference]: Finished difference Result 128 states and 214 transitions. [2024-11-16 14:26:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:26:47,058 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 14:26:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:47,066 INFO L225 Difference]: With dead ends: 128 [2024-11-16 14:26:47,067 INFO L226 Difference]: Without dead ends: 63 [2024-11-16 14:26:47,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:26:47,074 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:47,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:26:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-16 14:26:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-16 14:26:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 14:26:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 92 transitions. [2024-11-16 14:26:47,119 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 92 transitions. Word has length 111 [2024-11-16 14:26:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:47,121 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 92 transitions. [2024-11-16 14:26:47,121 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 92 transitions. [2024-11-16 14:26:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:47,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:47,126 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:47,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 14:26:47,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:47,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:47,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:47,330 INFO L85 PathProgramCache]: Analyzing trace with hash -810048925, now seen corresponding path program 1 times [2024-11-16 14:26:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:26:47,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463940690] [2024-11-16 14:26:47,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:47,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:26:47,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:26:47,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 14:26:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:47,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 14:26:47,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:26:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-16 14:26:50,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:26:51,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:26:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463940690] [2024-11-16 14:26:51,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463940690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:26:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [940050109] [2024-11-16 14:26:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 14:26:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 14:26:51,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 14:26:51,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-16 14:26:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:51,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 14:26:51,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:26:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 14:26:52,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:26:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [940050109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:26:52,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 14:26:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-16 14:26:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478081857] [2024-11-16 14:26:52,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:26:52,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:26:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:26:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:26:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 14:26:52,103 INFO L87 Difference]: Start difference. First operand 63 states and 92 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:54,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:26:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:54,558 INFO L93 Difference]: Finished difference Result 162 states and 234 transitions. [2024-11-16 14:26:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:26:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 14:26:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:54,589 INFO L225 Difference]: With dead ends: 162 [2024-11-16 14:26:54,589 INFO L226 Difference]: Without dead ends: 102 [2024-11-16 14:26:54,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 14:26:54,594 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:54,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 14:26:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-16 14:26:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-16 14:26:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 14:26:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-11-16 14:26:54,613 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 111 [2024-11-16 14:26:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:54,613 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-11-16 14:26:54,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 14:26:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-11-16 14:26:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 14:26:54,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:54,617 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:54,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-16 14:26:54,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:26:55,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:55,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:55,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash -598698012, now seen corresponding path program 1 times [2024-11-16 14:26:55,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:26:55,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527090984] [2024-11-16 14:26:55,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:55,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:26:55,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:26:55,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 14:26:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:55,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:26:55,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:26:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-16 14:26:55,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:26:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 14:26:56,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:26:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527090984] [2024-11-16 14:26:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527090984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:26:56,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:26:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 14:26:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775637861] [2024-11-16 14:26:56,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:26:56,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:26:56,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:26:56,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:26:56,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:26:56,604 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 14:26:59,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:26:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:26:59,229 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2024-11-16 14:26:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:26:59,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 111 [2024-11-16 14:26:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:26:59,257 INFO L225 Difference]: With dead ends: 168 [2024-11-16 14:26:59,258 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 14:26:59,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:26:59,259 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 53 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:26:59,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 167 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 14:26:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 14:26:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-16 14:26:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 14:26:59,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2024-11-16 14:26:59,269 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 111 [2024-11-16 14:26:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:26:59,269 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2024-11-16 14:26:59,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 14:26:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2024-11-16 14:26:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 14:26:59,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:26:59,273 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:26:59,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 14:26:59,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:59,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:26:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:26:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash 79232261, now seen corresponding path program 1 times [2024-11-16 14:26:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:26:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893890603] [2024-11-16 14:26:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:26:59,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:26:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:26:59,478 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:26:59,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 14:26:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:26:59,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 14:26:59,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:27:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-16 14:27:02,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:27:02,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:27:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893890603] [2024-11-16 14:27:02,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893890603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:27:02,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [757557380] [2024-11-16 14:27:02,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:27:02,737 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 14:27:02,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 14:27:02,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 14:27:02,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 14:27:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:27:03,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:27:03,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:27:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-16 14:27:05,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:27:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [757557380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:27:05,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:27:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-16 14:27:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859058642] [2024-11-16 14:27:05,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:27:05,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 14:27:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:27:05,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 14:27:05,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 14:27:05,745 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 14:27:10,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:27:12,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:27:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:27:13,213 INFO L93 Difference]: Finished difference Result 251 states and 336 transitions. [2024-11-16 14:27:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 14:27:13,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-11-16 14:27:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:27:13,216 INFO L225 Difference]: With dead ends: 251 [2024-11-16 14:27:13,216 INFO L226 Difference]: Without dead ends: 183 [2024-11-16 14:27:13,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-11-16 14:27:13,218 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 155 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-16 14:27:13,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 387 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-16 14:27:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-16 14:27:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 134. [2024-11-16 14:27:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 14:27:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 177 transitions. [2024-11-16 14:27:13,240 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 177 transitions. Word has length 112 [2024-11-16 14:27:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:27:13,240 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 177 transitions. [2024-11-16 14:27:13,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 14:27:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2024-11-16 14:27:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 14:27:13,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:27:13,243 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:27:13,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-16 14:27:13,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 14:27:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:27:13,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:27:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:27:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1432541958, now seen corresponding path program 1 times [2024-11-16 14:27:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:27:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265956631] [2024-11-16 14:27:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:27:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:27:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:27:13,648 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:27:13,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 14:27:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:27:14,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 14:27:14,111 INFO L278 TraceCheckSpWp]: Computing forward predicates...