./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.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_codestructure_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:18:48,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:18:48,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:18:48,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:18:48,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:18:48,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:18:48,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:18:48,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:18:48,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:18:48,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:18:48,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:18:48,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:18:48,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:18:48,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:18:48,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:18:48,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:18:48,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:18:48,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:18:48,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:18:48,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:18:48,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:18:48,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:18:48,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:18:48,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:18:48,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:18:48,227 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:18:48,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:18:48,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:18:48,228 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:18:48,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:18:48,228 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:18:48,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:18:48,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:18:48,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:18:48,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:18:48,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:18:48,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:18:48,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:18:48,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:18:48,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:18:48,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:18:48,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:18:48,233 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-11-16 12:18:48,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:18:48,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:18:48,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:18:48,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:18:48,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:18:48,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-16 12:18:50,041 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:18:50,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:18:50,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-16 12:18:50,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a5b54e7/680fc4bc83984a399d44c37584212b42/FLAG066d46413 [2024-11-16 12:18:50,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7a5b54e7/680fc4bc83984a399d44c37584212b42 [2024-11-16 12:18:50,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:18:50,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:18:50,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:18:50,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:18:50,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:18:50,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d11a529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50, skipping insertion in model container [2024-11-16 12:18:50,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:18:50,506 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_codestructure_normal_file-66.i[913,926] [2024-11-16 12:18:50,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:18:50,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:18:50,610 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_codestructure_normal_file-66.i[913,926] [2024-11-16 12:18:50,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:18:50,671 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:18:50,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50 WrapperNode [2024-11-16 12:18:50,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:18:50,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:18:50,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:18:50,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:18:50,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,732 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-11-16 12:18:50,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:18:50,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:18:50,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:18:50,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:18:50,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,773 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 12:18:50,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:18:50,798 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:18:50,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:18:50,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:18:50,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (1/1) ... [2024-11-16 12:18:50,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:18:50,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:18:50,844 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 12:18:50,853 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 12:18:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:18:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:18:50,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:18:50,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:18:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:18:50,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:18:51,005 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:18:51,008 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:18:51,381 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:18:51,381 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:18:51,415 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:18:51,415 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:18:51,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:51 BoogieIcfgContainer [2024-11-16 12:18:51,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:18:51,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:18:51,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:18:51,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:18:51,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:50" (1/3) ... [2024-11-16 12:18:51,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3bf923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:51, skipping insertion in model container [2024-11-16 12:18:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:50" (2/3) ... [2024-11-16 12:18:51,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c3bf923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:51, skipping insertion in model container [2024-11-16 12:18:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:51" (3/3) ... [2024-11-16 12:18:51,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-11-16 12:18:51,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:18:51,456 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:18:51,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:18:51,523 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;@3e6a33d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:18:51,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:18:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:18:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:18:51,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:51,543 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:51,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:51,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:51,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2125079665, now seen corresponding path program 1 times [2024-11-16 12:18:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:51,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857197457] [2024-11-16 12:18:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:18:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:18:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:18:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:18:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:18:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:18:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:18:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:18:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:18:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:18:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:18:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:18:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857197457] [2024-11-16 12:18:52,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857197457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:52,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:18:52,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788208228] [2024-11-16 12:18:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:52,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:18:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:52,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:18:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:18:52,123 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:18:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:52,158 INFO L93 Difference]: Finished difference Result 138 states and 245 transitions. [2024-11-16 12:18:52,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:18:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-11-16 12:18:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:52,171 INFO L225 Difference]: With dead ends: 138 [2024-11-16 12:18:52,171 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 12:18:52,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:18:52,178 INFO L432 NwaCegarLoop]: 105 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, 105 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 12:18:52,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:18:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 12:18:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-16 12:18:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:18:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2024-11-16 12:18:52,240 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 162 [2024-11-16 12:18:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:52,244 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2024-11-16 12:18:52,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:18:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2024-11-16 12:18:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:18:52,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:52,251 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:52,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:18:52,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:52,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1776184047, now seen corresponding path program 1 times [2024-11-16 12:18:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:52,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264441200] [2024-11-16 12:18:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:52,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:18:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:18:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:18:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:18:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:18:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:18:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:18:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:18:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:18:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:18:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:18:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:18:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:18:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:18:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:18:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:18:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:18:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:18:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:18:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:18:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:18:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:18:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:18:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:18:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:18:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:18:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:18:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:18:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:18:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264441200] [2024-11-16 12:18:57,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264441200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:18:57,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:18:57,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 12:18:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580638745] [2024-11-16 12:18:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:18:57,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 12:18:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:18:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 12:18:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:18:57,504 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:18:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:18:59,789 INFO L93 Difference]: Finished difference Result 233 states and 341 transitions. [2024-11-16 12:18:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 12:18:59,790 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 162 [2024-11-16 12:18:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:18:59,795 INFO L225 Difference]: With dead ends: 233 [2024-11-16 12:18:59,795 INFO L226 Difference]: Without dead ends: 168 [2024-11-16 12:18:59,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2024-11-16 12:18:59,800 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 376 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:18:59,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 372 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:18:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-16 12:18:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 79. [2024-11-16 12:18:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:18:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2024-11-16 12:18:59,831 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 162 [2024-11-16 12:18:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:18:59,834 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2024-11-16 12:18:59,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:18:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2024-11-16 12:18:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:18:59,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:18:59,840 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:18:59,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:18:59,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:18:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:18:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1747554896, now seen corresponding path program 1 times [2024-11-16 12:18:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:18:59,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511596062] [2024-11-16 12:18:59,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:18:59,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:18:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:19:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:19:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:19:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:19:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:19:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:19:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:19:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:19:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:19:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:19:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:19:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:19:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:19:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:19:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:19:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:19:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:19:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:19:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:19:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:19:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:19:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:19:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:19:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:19:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:19:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:19:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:19:02,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:02,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511596062] [2024-11-16 12:19:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511596062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:02,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:19:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77452845] [2024-11-16 12:19:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:02,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:19:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:19:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:19:02,307 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:02,888 INFO L93 Difference]: Finished difference Result 168 states and 236 transitions. [2024-11-16 12:19:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:19:02,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-16 12:19:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:02,892 INFO L225 Difference]: With dead ends: 168 [2024-11-16 12:19:02,893 INFO L226 Difference]: Without dead ends: 165 [2024-11-16 12:19:02,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:19:02,894 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 162 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:02,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 441 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:19:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-16 12:19:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 79. [2024-11-16 12:19:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:19:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2024-11-16 12:19:02,916 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 162 [2024-11-16 12:19:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:02,917 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2024-11-16 12:19:02,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2024-11-16 12:19:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:02,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:02,920 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:19:02,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -888680366, now seen corresponding path program 1 times [2024-11-16 12:19:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687965534] [2024-11-16 12:19:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:19:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:19:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:19:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:19:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:19:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:19:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:19:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:19:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:19:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:19:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:19:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:19:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:19:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:19:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:19:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:19:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:19:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:19:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:19:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:19:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:19:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:19:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:19:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:19:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:19:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:19:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:19:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687965534] [2024-11-16 12:19:16,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687965534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:16,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:16,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:19:16,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605599559] [2024-11-16 12:19:16,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:16,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:19:16,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:16,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:19:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:19:16,092 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:17,065 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-11-16 12:19:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:19:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-16 12:19:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:17,071 INFO L225 Difference]: With dead ends: 156 [2024-11-16 12:19:17,072 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 12:19:17,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:19:17,076 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:17,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 489 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:19:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 12:19:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 83. [2024-11-16 12:19:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:19:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-11-16 12:19:17,103 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 162 [2024-11-16 12:19:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-11-16 12:19:17,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-11-16 12:19:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:17,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:17,109 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:17,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:19:17,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:17,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash -33373712, now seen corresponding path program 1 times [2024-11-16 12:19:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348409200] [2024-11-16 12:19:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:19:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:19:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:19:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:19:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:19:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:19:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:19:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:19:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:19:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:19:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:19:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:19:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:19:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:19:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:19:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:19:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:19:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:19:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:19:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:19:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:19:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:19:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:19:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:19:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:19:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:19:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:19:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348409200] [2024-11-16 12:19:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348409200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 12:19:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226232565] [2024-11-16 12:19:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:20,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 12:19:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 12:19:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:19:20,700 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:19:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:23,960 INFO L93 Difference]: Finished difference Result 185 states and 264 transitions. [2024-11-16 12:19:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 12:19:23,961 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 162 [2024-11-16 12:19:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:23,962 INFO L225 Difference]: With dead ends: 185 [2024-11-16 12:19:23,962 INFO L226 Difference]: Without dead ends: 182 [2024-11-16 12:19:23,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2024-11-16 12:19:23,964 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 331 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:23,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 373 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:19:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-16 12:19:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 87. [2024-11-16 12:19:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 59 states have internal predecessors, (86), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:19:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-11-16 12:19:23,988 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 162 [2024-11-16 12:19:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-11-16 12:19:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:19:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-11-16 12:19:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:23,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:23,990 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:23,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:19:23,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash -4744561, now seen corresponding path program 1 times [2024-11-16 12:19:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:23,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883018766] [2024-11-16 12:19:23,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:23,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:19:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:19:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:19:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:19:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:19:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:19:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:19:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:19:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:19:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:19:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:19:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:19:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:19:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:19:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:19:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:19:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:19:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:19:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:19:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:19:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:19:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:19:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:19:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:19:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:19:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:19:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:19:38,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:38,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883018766] [2024-11-16 12:19:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883018766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:38,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:38,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:19:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184327669] [2024-11-16 12:19:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:38,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:19:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:38,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:19:38,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:19:38,337 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:39,360 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2024-11-16 12:19:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:19:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-16 12:19:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:39,362 INFO L225 Difference]: With dead ends: 153 [2024-11-16 12:19:39,363 INFO L226 Difference]: Without dead ends: 150 [2024-11-16 12:19:39,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:19:39,364 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 157 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:39,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 467 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:19:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-16 12:19:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2024-11-16 12:19:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:19:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-11-16 12:19:39,376 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 162 [2024-11-16 12:19:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:39,377 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-11-16 12:19:39,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-11-16 12:19:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:39,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:39,379 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:19:39,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:39,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:39,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2028866737, now seen corresponding path program 1 times [2024-11-16 12:19:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248351949] [2024-11-16 12:19:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:19:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:19:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:19:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:19:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:19:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:19:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:19:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:19:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:19:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:19:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:19:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:19:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:19:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:19:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:19:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:19:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:19:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:19:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:19:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:19:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:19:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:19:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:19:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:19:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:19:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:19:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:19:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248351949] [2024-11-16 12:19:39,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248351949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:39,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:19:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795659590] [2024-11-16 12:19:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:19:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:19:39,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:19:39,514 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:39,675 INFO L93 Difference]: Finished difference Result 271 states and 421 transitions. [2024-11-16 12:19:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:19:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-11-16 12:19:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:39,681 INFO L225 Difference]: With dead ends: 271 [2024-11-16 12:19:39,681 INFO L226 Difference]: Without dead ends: 191 [2024-11-16 12:19:39,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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 12:19:39,688 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 86 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:39,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 297 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:19:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-16 12:19:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2024-11-16 12:19:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 122 states have (on average 1.401639344262295) internal successors, (171), 123 states have internal predecessors, (171), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 12:19:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 287 transitions. [2024-11-16 12:19:39,727 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 287 transitions. Word has length 162 [2024-11-16 12:19:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:39,730 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 287 transitions. [2024-11-16 12:19:39,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-16 12:19:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 287 transitions. [2024-11-16 12:19:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:39,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:39,734 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:39,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:19:39,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:39,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:39,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1378596878, now seen corresponding path program 1 times [2024-11-16 12:19:39,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:39,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960139176] [2024-11-16 12:19:39,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:39,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:19:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:19:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:19:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:19:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:19:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:19:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:19:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:19:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:19:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:19:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:19:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:19:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:19:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:19:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:19:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:19:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:19:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:19:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:19:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 12:19:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:19:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 12:19:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 12:19:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 12:19:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 12:19:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-16 12:19:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-16 12:19:40,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:40,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960139176] [2024-11-16 12:19:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960139176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:40,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:19:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931666175] [2024-11-16 12:19:40,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:40,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:19:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:40,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:19:40,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:19:40,328 INFO L87 Difference]: Start difference. First operand 184 states and 287 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:19:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:40,859 INFO L93 Difference]: Finished difference Result 492 states and 742 transitions. [2024-11-16 12:19:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:19:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 162 [2024-11-16 12:19:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:40,866 INFO L225 Difference]: With dead ends: 492 [2024-11-16 12:19:40,868 INFO L226 Difference]: Without dead ends: 311 [2024-11-16 12:19:40,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:19:40,870 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 260 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:40,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 606 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:19:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-16 12:19:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 188. [2024-11-16 12:19:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 126 states have (on average 1.4365079365079365) internal successors, (181), 127 states have internal predecessors, (181), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 12:19:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 297 transitions. [2024-11-16 12:19:40,905 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 297 transitions. Word has length 162 [2024-11-16 12:19:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:40,906 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 297 transitions. [2024-11-16 12:19:40,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:19:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 297 transitions. [2024-11-16 12:19:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 12:19:40,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:40,908 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:40,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:19:40,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1071225454, now seen corresponding path program 1 times [2024-11-16 12:19:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915796129] [2024-11-16 12:19:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:19:40,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919573408] [2024-11-16 12:19:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:40,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:19:40,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:19:40,981 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 12:19:40,982 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 12:19:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:41,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 12:19:41,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:19:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 796 proven. 165 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-11-16 12:19:42,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:19:43,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:19:43,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915796129] [2024-11-16 12:19:43,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 12:19:43,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919573408] [2024-11-16 12:19:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919573408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:19:43,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 12:19:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-16 12:19:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098695039] [2024-11-16 12:19:43,209 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 12:19:43,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 12:19:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:19:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 12:19:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-11-16 12:19:43,211 INFO L87 Difference]: Start difference. First operand 188 states and 297 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-16 12:19:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:43,803 INFO L93 Difference]: Finished difference Result 592 states and 881 transitions. [2024-11-16 12:19:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 12:19:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 163 [2024-11-16 12:19:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:43,807 INFO L225 Difference]: With dead ends: 592 [2024-11-16 12:19:43,807 INFO L226 Difference]: Without dead ends: 407 [2024-11-16 12:19:43,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2024-11-16 12:19:43,809 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 236 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:19:43,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 319 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:19:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-16 12:19:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 342. [2024-11-16 12:19:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 227 states have (on average 1.3171806167400881) internal successors, (299), 232 states have internal predecessors, (299), 100 states have call successors, (100), 14 states have call predecessors, (100), 14 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 12:19:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 499 transitions. [2024-11-16 12:19:43,860 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 499 transitions. Word has length 163 [2024-11-16 12:19:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:43,861 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 499 transitions. [2024-11-16 12:19:43,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 5 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-16 12:19:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 499 transitions. [2024-11-16 12:19:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 12:19:43,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:43,863 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:43,879 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 12:19:44,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:19:44,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:44,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 671584881, now seen corresponding path program 1 times [2024-11-16 12:19:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:19:44,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312250238] [2024-11-16 12:19:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:19:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:19:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854956234] [2024-11-16 12:19:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:44,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:19:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:19:44,116 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 12:19:44,119 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 12:19:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:19:44,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:19:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:19:44,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:19:44,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:19:44,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:19:44,619 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 12:19:44,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 12:19:44,804 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:44,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:19:44,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:19:44 BoogieIcfgContainer [2024-11-16 12:19:44,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:19:44,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:19:44,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:19:44,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:19:44,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:18:51" (3/4) ... [2024-11-16 12:19:44,932 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:19:44,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:19:44,934 INFO L158 Benchmark]: Toolchain (without parser) took 54652.73ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 110.6MB in the beginning and 739.5MB in the end (delta: -628.9MB). Peak memory consumption was 219.8MB. Max. memory is 16.1GB. [2024-11-16 12:19:44,934 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:19:44,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.88ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 94.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:19:44,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.06ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 91.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:19:44,935 INFO L158 Benchmark]: Boogie Preprocessor took 63.31ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 87.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:19:44,935 INFO L158 Benchmark]: IcfgBuilder took 617.66ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 134.7MB in the end (delta: -47.7MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-11-16 12:19:44,936 INFO L158 Benchmark]: TraceAbstraction took 53496.95ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 133.8MB in the beginning and 739.5MB in the end (delta: -605.7MB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. [2024-11-16 12:19:44,936 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 1.0GB. Free memory is still 739.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:19:44,937 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.88ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 94.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.06ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 91.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.31ms. Allocated memory is still 167.8MB. Free memory was 91.7MB in the beginning and 87.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 617.66ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 134.7MB in the end (delta: -47.7MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 53496.95ms. Allocated memory was 167.8MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 133.8MB in the beginning and 739.5MB in the end (delta: -605.7MB). Peak memory consumption was 239.1MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 1.0GB. Free memory is still 739.5MB. 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 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 10; [L26] double var_1_5 = 16.5; [L27] signed char var_1_6 = 64; [L28] signed char var_1_7 = 2; [L29] unsigned short int var_1_8 = 256; [L30] unsigned char var_1_9 = 0; [L31] unsigned short int var_1_10 = 63583; [L32] unsigned short int var_1_11 = 33789; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] signed long int var_1_15 = 8; [L37] signed short int var_1_16 = -16; [L38] unsigned short int var_1_17 = 32; [L39] signed short int var_1_18 = 16; [L40] signed short int var_1_19 = 25; [L41] signed short int var_1_20 = 25; [L42] signed short int var_1_21 = 50; VAL [isInitial=0, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=0, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L90] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L92] var_1_4 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L93] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L95] var_1_6 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L96] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256, var_1_9=0] [L98] var_1_7 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L100] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=0] [L101] var_1_9 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L103] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L104] var_1_10 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L105] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L106] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L107] var_1_11 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L108] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L109] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L110] var_1_13 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L111] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L112] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L113] var_1_14 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L115] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L117] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L121] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L123] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L124] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L49] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/2, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L50] COND TRUE \read(var_1_2) [L51] var_1_5 = 8.25 VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=256, var_1_9=1] [L54] COND FALSE !(-25 == var_1_6) [L59] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L61] COND TRUE var_1_8 >= var_1_7 [L62] var_1_12 = (! var_1_14) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L64] COND TRUE -64 > (var_1_6 + var_1_1) [L65] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L73] COND FALSE !(var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=16, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L76] COND TRUE var_1_1 < var_1_6 [L77] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=25, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L81] COND TRUE \read(var_1_13) [L82] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_2 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_2 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((var_1_2 && var_1_9) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_1)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_13 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=32766, var_1_16=-16, var_1_17=-32769, var_1_18=-2, var_1_19=0, var_1_1=-65, var_1_20=0, var_1_21=0, var_1_2=1, var_1_3=-63, var_1_4=-2, var_1_5=33/4, var_1_6=-1, var_1_7=1, var_1_8=32767, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.3s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1788 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1764 mSDsluCounter, 3469 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2526 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2224 IncrementalHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 943 mSDtfsCounter, 2224 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=9, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 602 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 1948 NumberOfCodeBlocks, 1948 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1450 ConstructedInterpolants, 0 QuantifiedInterpolants, 9891 SizeOfPredicates, 7 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 11535/11700 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 12:19:45,154 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-16 12:19:45,188 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:19:47,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:19:47,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:19:47,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:19:47,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:19:47,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:19:47,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:19:47,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:19:47,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:19:47,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:19:47,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:19:47,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:19:47,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:19:47,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:19:47,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:19:47,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:19:47,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:19:47,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:19:47,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:19:47,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:19:47,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:19:47,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:19:47,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:19:47,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:19:47,241 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:19:47,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:19:47,241 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:19:47,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:19:47,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:19:47,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:19:47,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:19:47,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:19:47,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:19:47,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:19:47,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:19:47,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:19:47,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:19:47,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:19:47,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:19:47,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:19:47,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:19:47,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:19:47,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:19:47,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:19:47,248 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-11-16 12:19:47,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:19:47,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:19:47,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:19:47,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:19:47,568 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:19:47,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-16 12:19:49,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:19:49,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:19:49,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-11-16 12:19:49,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c75dcab2a/264302f3ef41494282133bc9848a30fa/FLAGc70019a37 [2024-11-16 12:19:49,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c75dcab2a/264302f3ef41494282133bc9848a30fa [2024-11-16 12:19:49,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:19:49,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:19:49,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:19:49,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:19:49,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:19:49,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c249094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49, skipping insertion in model container [2024-11-16 12:19:49,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:19:49,585 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_codestructure_normal_file-66.i[913,926] [2024-11-16 12:19:49,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:19:49,701 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:19:49,714 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_codestructure_normal_file-66.i[913,926] [2024-11-16 12:19:49,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:19:49,776 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:19:49,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49 WrapperNode [2024-11-16 12:19:49,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:19:49,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:19:49,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:19:49,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:19:49,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,829 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-16 12:19:49,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:19:49,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:19:49,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:19:49,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:19:49,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,865 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 12:19:49,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:19:49,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:19:49,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:19:49,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:19:49,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (1/1) ... [2024-11-16 12:19:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:19:49,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:19:49,937 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 12:19:49,940 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 12:19:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:19:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:19:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:19:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:19:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:19:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:19:50,071 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:19:50,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:19:50,507 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:19:50,508 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:19:50,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:19:50,528 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:19:50,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:19:50 BoogieIcfgContainer [2024-11-16 12:19:50,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:19:50,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:19:50,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:19:50,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:19:50,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:19:49" (1/3) ... [2024-11-16 12:19:50,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:50, skipping insertion in model container [2024-11-16 12:19:50,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:19:49" (2/3) ... [2024-11-16 12:19:50,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:19:50, skipping insertion in model container [2024-11-16 12:19:50,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:19:50" (3/3) ... [2024-11-16 12:19:50,537 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-11-16 12:19:50,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:19:50,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:19:50,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:19:50,635 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;@6ad716c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:19:50,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:19:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:19:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:50,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:50,657 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:50,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:50,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2125079665, now seen corresponding path program 1 times [2024-11-16 12:19:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:19:50,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095221435] [2024-11-16 12:19:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:50,679 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 12:19:50,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:19:50,684 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 12:19:50,685 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 12:19:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:50,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:19:50,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:19:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-16 12:19:50,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:19:50,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:19:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095221435] [2024-11-16 12:19:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095221435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:19:50,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:19:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:19:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915366499] [2024-11-16 12:19:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:19:50,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:19:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:19:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:19:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:19:51,021 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:19:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:19:51,053 INFO L93 Difference]: Finished difference Result 138 states and 245 transitions. [2024-11-16 12:19:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:19:51,055 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-11-16 12:19:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:19:51,062 INFO L225 Difference]: With dead ends: 138 [2024-11-16 12:19:51,063 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 12:19:51,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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 12:19:51,074 INFO L432 NwaCegarLoop]: 105 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, 105 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 12:19:51,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:19:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 12:19:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-16 12:19:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:19:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2024-11-16 12:19:51,134 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 162 [2024-11-16 12:19:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:19:51,135 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2024-11-16 12:19:51,135 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-16 12:19:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2024-11-16 12:19:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 12:19:51,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:19:51,141 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:19:51,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:19:51,342 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 12:19:51,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:19:51,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:19:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1776184047, now seen corresponding path program 1 times [2024-11-16 12:19:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:19:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581933333] [2024-11-16 12:19:51,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:19:51,345 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 12:19:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:19:51,347 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 12:19:51,381 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 12:19:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:19:51,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 12:19:51,553 INFO L278 TraceCheckSpWp]: Computing forward predicates...