./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:53:29,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:53:29,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:53:29,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:53:29,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:53:29,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:53:29,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:53:29,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:53:29,942 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:53:29,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:53:29,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:53:29,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:53:29,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:53:29,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:53:29,944 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:53:29,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:53:29,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:53:29,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:53:29,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:53:29,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:53:29,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:53:29,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:53:29,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:53:29,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:53:29,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:53:29,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:53:29,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:53:29,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:53:29,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:53:29,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:53:29,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:53:29,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:53:29,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:53:29,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:53:29,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:53:29,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:53:29,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:53:29,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:53:29,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:53:29,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:53:29,957 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:53:29,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:53:29,958 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-11-08 22:53:30,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:53:30,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:53:30,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:53:30,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:53:30,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:53:30,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-11-08 22:53:31,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:53:31,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:53:31,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-11-08 22:53:31,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d273a1f6/3fa64caff79840e58957561df2e8020d/FLAG1bf3fcc81 [2024-11-08 22:53:32,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d273a1f6/3fa64caff79840e58957561df2e8020d [2024-11-08 22:53:32,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:53:32,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:53:32,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:53:32,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:53:32,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:53:32,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c4e45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32, skipping insertion in model container [2024-11-08 22:53:32,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:53:32,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-11-08 22:53:32,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:53:32,640 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:53:32,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-11-08 22:53:32,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:53:32,696 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:53:32,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32 WrapperNode [2024-11-08 22:53:32,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:53:32,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:53:32,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:53:32,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:53:32,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,774 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 22:53:32,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:53:32,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:53:32,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:53:32,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:53:32,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,838 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:53:32,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:53:32,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:53:32,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:53:32,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:53:32,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (1/1) ... [2024-11-08 22:53:32,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:53:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:53:32,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:53:32,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:53:33,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:53:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:53:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:53:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:53:33,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:53:33,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:53:33,096 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:53:33,099 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:53:33,516 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 22:53:33,517 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:53:33,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:53:33,540 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:53:33,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:53:33 BoogieIcfgContainer [2024-11-08 22:53:33,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:53:33,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:53:33,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:53:33,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:53:33,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:53:32" (1/3) ... [2024-11-08 22:53:33,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ea75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:53:33, skipping insertion in model container [2024-11-08 22:53:33,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:53:32" (2/3) ... [2024-11-08 22:53:33,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ea75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:53:33, skipping insertion in model container [2024-11-08 22:53:33,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:53:33" (3/3) ... [2024-11-08 22:53:33,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-84.i [2024-11-08 22:53:33,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:53:33,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:53:33,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:53:33,626 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;@26c27b1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:53:33,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:53:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:53:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 22:53:33,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:33,643 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:33,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:33,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1756229400, now seen corresponding path program 1 times [2024-11-08 22:53:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:33,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527783598] [2024-11-08 22:53:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:33,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:33,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:33,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527783598] [2024-11-08 22:53:34,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527783598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:34,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:34,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:53:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429912] [2024-11-08 22:53:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:34,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:53:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:53:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:53:34,178 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:53:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:34,222 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. [2024-11-08 22:53:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:53:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2024-11-08 22:53:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:34,236 INFO L225 Difference]: With dead ends: 155 [2024-11-08 22:53:34,236 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 22:53:34,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:53:34,246 INFO L432 NwaCegarLoop]: 116 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, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:34,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:53:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 22:53:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 22:53:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:53:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-08 22:53:34,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 145 [2024-11-08 22:53:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:34,309 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-08 22:53:34,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:53:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-08 22:53:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 22:53:34,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:34,317 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:53:34,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash 394550616, now seen corresponding path program 1 times [2024-11-08 22:53:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377864601] [2024-11-08 22:53:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:34,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:34,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377864601] [2024-11-08 22:53:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377864601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:34,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:34,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:53:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515827980] [2024-11-08 22:53:34,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:34,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:53:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:34,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:53:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:53:34,919 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:34,953 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2024-11-08 22:53:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:53:34,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 22:53:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:34,957 INFO L225 Difference]: With dead ends: 151 [2024-11-08 22:53:34,958 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 22:53:34,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:53:34,961 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:34,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:53:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 22:53:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 22:53:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:53:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-08 22:53:34,980 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 145 [2024-11-08 22:53:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:34,983 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-08 22:53:34,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-08 22:53:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 22:53:34,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:34,986 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:34,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:53:34,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:34,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 652716054, now seen corresponding path program 1 times [2024-11-08 22:53:34,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:34,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856339726] [2024-11-08 22:53:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:38,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:38,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856339726] [2024-11-08 22:53:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856339726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:38,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:53:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733866829] [2024-11-08 22:53:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:38,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:53:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:53:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:53:38,401 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:39,481 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2024-11-08 22:53:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:53:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 22:53:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:39,487 INFO L225 Difference]: With dead ends: 186 [2024-11-08 22:53:39,487 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 22:53:39,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:53:39,489 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 69 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:39,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 395 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:53:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 22:53:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-11-08 22:53:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.325) internal successors, (106), 81 states have internal predecessors, (106), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 22:53:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-11-08 22:53:39,509 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 145 [2024-11-08 22:53:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:39,510 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-11-08 22:53:39,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-11-08 22:53:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:53:39,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:39,513 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:39,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:53:39,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:39,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1697318672, now seen corresponding path program 1 times [2024-11-08 22:53:39,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050839347] [2024-11-08 22:53:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:39,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:40,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:40,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050839347] [2024-11-08 22:53:40,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050839347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:40,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:40,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:53:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378091895] [2024-11-08 22:53:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:40,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:53:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:53:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:53:40,588 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:40,870 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2024-11-08 22:53:40,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:53:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 22:53:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:40,877 INFO L225 Difference]: With dead ends: 247 [2024-11-08 22:53:40,877 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 22:53:40,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:53:40,879 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 68 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:40,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 459 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:53:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 22:53:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-11-08 22:53:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.320754716981132) internal successors, (140), 108 states have internal predecessors, (140), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:53:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-08 22:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 146 [2024-11-08 22:53:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:40,897 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-08 22:53:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-08 22:53:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:53:40,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:40,899 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:40,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:53:40,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:40,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:40,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1586531374, now seen corresponding path program 1 times [2024-11-08 22:53:40,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:40,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030028077] [2024-11-08 22:53:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:40,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:41,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030028077] [2024-11-08 22:53:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030028077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:41,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:53:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509324228] [2024-11-08 22:53:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:41,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:53:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:53:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:53:41,563 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:41,911 INFO L93 Difference]: Finished difference Result 289 states and 404 transitions. [2024-11-08 22:53:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:53:41,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 22:53:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:41,915 INFO L225 Difference]: With dead ends: 289 [2024-11-08 22:53:41,916 INFO L226 Difference]: Without dead ends: 154 [2024-11-08 22:53:41,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:53:41,919 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:41,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 489 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:53:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-08 22:53:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2024-11-08 22:53:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 90 states have internal predecessors, (113), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:53:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2024-11-08 22:53:41,951 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 146 [2024-11-08 22:53:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:41,953 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2024-11-08 22:53:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2024-11-08 22:53:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:53:41,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:41,955 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:41,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:53:41,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -14262287, now seen corresponding path program 1 times [2024-11-08 22:53:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613960413] [2024-11-08 22:53:41,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613960413] [2024-11-08 22:53:46,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613960413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:46,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:46,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 22:53:46,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655126896] [2024-11-08 22:53:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:46,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:53:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:53:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:53:46,816 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:48,075 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-11-08 22:53:48,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 22:53:48,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-08 22:53:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:48,080 INFO L225 Difference]: With dead ends: 328 [2024-11-08 22:53:48,081 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 22:53:48,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 22:53:48,083 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 72 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:48,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 554 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 22:53:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 22:53:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2024-11-08 22:53:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:53:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-08 22:53:48,112 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-08 22:53:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:48,113 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-08 22:53:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-08 22:53:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:53:48,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:48,117 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:48,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:53:48,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:48,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash 686802291, now seen corresponding path program 1 times [2024-11-08 22:53:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:48,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441959317] [2024-11-08 22:53:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:53,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441959317] [2024-11-08 22:53:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441959317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 22:53:53,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141482079] [2024-11-08 22:53:53,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 22:53:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 22:53:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:53:53,322 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:55,007 INFO L93 Difference]: Finished difference Result 365 states and 506 transitions. [2024-11-08 22:53:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 22:53:55,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-08 22:53:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:55,010 INFO L225 Difference]: With dead ends: 365 [2024-11-08 22:53:55,010 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 22:53:55,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-08 22:53:55,012 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 119 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:55,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 676 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 22:53:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 22:53:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2024-11-08 22:53:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 121 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:53:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-08 22:53:55,028 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 147 [2024-11-08 22:53:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:55,029 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-08 22:53:55,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-08 22:53:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 22:53:55,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:55,031 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:55,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:53:55,031 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 341528847, now seen corresponding path program 1 times [2024-11-08 22:53:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:55,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563579833] [2024-11-08 22:53:55,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563579833] [2024-11-08 22:53:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563579833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:53:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203158227] [2024-11-08 22:53:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:53:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:53:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:53:55,158 INFO L87 Difference]: Start difference. First operand 152 states and 212 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:55,273 INFO L93 Difference]: Finished difference Result 360 states and 500 transitions. [2024-11-08 22:53:55,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:53:55,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-08 22:53:55,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:55,276 INFO L225 Difference]: With dead ends: 360 [2024-11-08 22:53:55,276 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 22:53:55,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:53:55,277 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 39 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:55,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:53:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 22:53:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 188. [2024-11-08 22:53:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 155 states have (on average 1.3161290322580645) internal successors, (204), 157 states have internal predecessors, (204), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:53:55,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 260 transitions. [2024-11-08 22:53:55,294 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 260 transitions. Word has length 148 [2024-11-08 22:53:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:55,295 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 260 transitions. [2024-11-08 22:53:55,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 260 transitions. [2024-11-08 22:53:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 22:53:55,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:55,297 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:55,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:53:55,298 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:55,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1974933933, now seen corresponding path program 1 times [2024-11-08 22:53:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890228367] [2024-11-08 22:53:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:55,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890228367] [2024-11-08 22:53:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890228367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:53:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829647735] [2024-11-08 22:53:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:55,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:53:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:53:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:53:55,572 INFO L87 Difference]: Start difference. First operand 188 states and 260 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:55,744 INFO L93 Difference]: Finished difference Result 521 states and 722 transitions. [2024-11-08 22:53:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:53:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-08 22:53:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:55,748 INFO L225 Difference]: With dead ends: 521 [2024-11-08 22:53:55,748 INFO L226 Difference]: Without dead ends: 336 [2024-11-08 22:53:55,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:53:55,749 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 88 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:55,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 383 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:53:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-08 22:53:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 236. [2024-11-08 22:53:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 178 states have (on average 1.2808988764044944) internal successors, (228), 180 states have internal predecessors, (228), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 22:53:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 328 transitions. [2024-11-08 22:53:55,780 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 328 transitions. Word has length 148 [2024-11-08 22:53:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:55,783 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 328 transitions. [2024-11-08 22:53:55,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2024-11-08 22:53:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 22:53:55,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:55,785 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:55,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 22:53:55,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:55,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1687224997, now seen corresponding path program 1 times [2024-11-08 22:53:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:55,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039091025] [2024-11-08 22:53:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:53:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:53:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:53:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:53:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:53:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:53:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:53:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:53:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:53:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:53:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:53:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:53:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:53:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:53:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:53:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 22:53:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 22:53:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 22:53:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 22:53:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 22:53:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 22:53:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 22:53:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:53:55,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:53:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039091025] [2024-11-08 22:53:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039091025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:55,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:53:55,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:53:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024505012] [2024-11-08 22:53:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:53:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:53:55,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:53:55,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:53:55,906 INFO L87 Difference]: Start difference. First operand 236 states and 328 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:56,018 INFO L93 Difference]: Finished difference Result 448 states and 615 transitions. [2024-11-08 22:53:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:53:56,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-08 22:53:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:56,021 INFO L225 Difference]: With dead ends: 448 [2024-11-08 22:53:56,021 INFO L226 Difference]: Without dead ends: 263 [2024-11-08 22:53:56,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:53:56,022 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:56,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 193 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:53:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-08 22:53:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 221. [2024-11-08 22:53:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 165 states have (on average 1.2666666666666666) internal successors, (209), 166 states have internal predecessors, (209), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 22:53:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 305 transitions. [2024-11-08 22:53:56,050 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 305 transitions. Word has length 148 [2024-11-08 22:53:56,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:56,051 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 305 transitions. [2024-11-08 22:53:56,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:53:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 305 transitions. [2024-11-08 22:53:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 22:53:56,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:56,053 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:56,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 22:53:56,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:56,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1655306804, now seen corresponding path program 1 times [2024-11-08 22:53:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:53:56,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077322082] [2024-11-08 22:53:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:53:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:53:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1555318330] [2024-11-08 22:53:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:53:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:53:56,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:53:56,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:53:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:53:56,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:53:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:53:56,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:53:56,516 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:53:56,517 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:53:56,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:53:56,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 22:53:56,723 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:53:56,832 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:53:56,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:53:56 BoogieIcfgContainer [2024-11-08 22:53:56,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:53:56,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:53:56,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:53:56,835 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:53:56,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:53:33" (3/4) ... [2024-11-08 22:53:56,842 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:53:56,843 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:53:56,848 INFO L158 Benchmark]: Toolchain (without parser) took 24497.31ms. Allocated memory was 134.2MB in the beginning and 362.8MB in the end (delta: 228.6MB). Free memory was 79.9MB in the beginning and 280.5MB in the end (delta: -200.7MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2024-11-08 22:53:56,848 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:53:56,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.43ms. Allocated memory is still 134.2MB. Free memory was 79.6MB in the beginning and 63.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:53:56,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.52ms. Allocated memory is still 134.2MB. Free memory was 63.4MB in the beginning and 59.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:53:56,849 INFO L158 Benchmark]: Boogie Preprocessor took 123.24ms. Allocated memory is still 134.2MB. Free memory was 59.6MB in the beginning and 104.5MB in the end (delta: -44.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-08 22:53:56,849 INFO L158 Benchmark]: RCFGBuilder took 640.99ms. Allocated memory is still 134.2MB. Free memory was 104.5MB in the beginning and 78.7MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 22:53:56,850 INFO L158 Benchmark]: TraceAbstraction took 23291.99ms. Allocated memory was 134.2MB in the beginning and 362.8MB in the end (delta: 228.6MB). Free memory was 78.1MB in the beginning and 280.5MB in the end (delta: -202.4MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-11-08 22:53:56,850 INFO L158 Benchmark]: Witness Printer took 8.44ms. Allocated memory is still 362.8MB. Free memory is still 280.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:53:56,855 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 134.2MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.43ms. Allocated memory is still 134.2MB. Free memory was 79.6MB in the beginning and 63.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.52ms. Allocated memory is still 134.2MB. Free memory was 63.4MB in the beginning and 59.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.24ms. Allocated memory is still 134.2MB. Free memory was 59.6MB in the beginning and 104.5MB in the end (delta: -44.9MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * RCFGBuilder took 640.99ms. Allocated memory is still 134.2MB. Free memory was 104.5MB in the beginning and 78.7MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23291.99ms. Allocated memory was 134.2MB in the beginning and 362.8MB in the end (delta: 228.6MB). Free memory was 78.1MB in the beginning and 280.5MB in the end (delta: -202.4MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 8.44ms. Allocated memory is still 362.8MB. Free memory is still 280.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 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L92] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L113] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L127] RET updateVariables() [L128] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L60] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119-L120] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 658 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 658 mSDsluCounter, 3550 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2444 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 1106 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 350 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 1763 NumberOfCodeBlocks, 1763 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1455 ConstructedInterpolants, 0 QuantifiedInterpolants, 6174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 9240/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:53:56,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.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 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:53:59,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:53:59,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:53:59,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:53:59,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:53:59,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:53:59,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:53:59,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:53:59,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:53:59,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:53:59,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:53:59,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:53:59,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:53:59,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:53:59,329 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:53:59,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:53:59,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:53:59,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:53:59,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:53:59,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:53:59,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:53:59,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:53:59,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:53:59,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:53:59,332 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:53:59,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:53:59,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:53:59,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:53:59,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:53:59,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:53:59,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:53:59,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:53:59,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:53:59,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:53:59,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:53:59,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:53:59,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:53:59,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:53:59,336 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:53:59,336 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:53:59,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:53:59,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:53:59,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:53:59,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:53:59,338 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 -> 5b5c579625c7e7f8372c6e72b92791251deae7da0317f60eb86bbc80368b12cf [2024-11-08 22:53:59,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:53:59,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:53:59,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:53:59,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:53:59,716 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:53:59,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-11-08 22:54:01,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:54:01,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:54:01,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i [2024-11-08 22:54:01,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5497337c8/2bd62c65d37a485b912cfedeffbd7835/FLAG33fff9da0 [2024-11-08 22:54:01,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5497337c8/2bd62c65d37a485b912cfedeffbd7835 [2024-11-08 22:54:01,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:54:01,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:54:01,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:01,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:54:01,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:54:01,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:01" (1/1) ... [2024-11-08 22:54:01,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abc5b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:01, skipping insertion in model container [2024-11-08 22:54:01,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:54:01" (1/1) ... [2024-11-08 22:54:01,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:54:01,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-11-08 22:54:01,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:01,942 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:54:01,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-84.i[913,926] [2024-11-08 22:54:02,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:54:02,027 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:54:02,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02 WrapperNode [2024-11-08 22:54:02,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:54:02,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:02,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:54:02,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:54:02,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,087 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-08 22:54:02,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:54:02,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:54:02,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:54:02,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:54:02,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,132 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:54:02,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:54:02,175 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:54:02,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:54:02,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:54:02,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (1/1) ... [2024-11-08 22:54:02,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:54:02,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:54:02,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:54:02,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:54:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:54:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:54:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:54:02,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:54:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:54:02,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:54:02,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:54:02,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:54:02,893 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 22:54:02,894 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:54:02,911 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:54:02,911 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:54:02,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:02 BoogieIcfgContainer [2024-11-08 22:54:02,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:54:02,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:54:02,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:54:02,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:54:02,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:54:01" (1/3) ... [2024-11-08 22:54:02,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6086af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:02, skipping insertion in model container [2024-11-08 22:54:02,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:54:02" (2/3) ... [2024-11-08 22:54:02,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6086af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:54:02, skipping insertion in model container [2024-11-08 22:54:02,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:54:02" (3/3) ... [2024-11-08 22:54:02,923 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-84.i [2024-11-08 22:54:02,941 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:54:02,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:54:03,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:54:03,029 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;@37019a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:54:03,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:54:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:54:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:54:03,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:03,067 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:03,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2103567624, now seen corresponding path program 1 times [2024-11-08 22:54:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645906220] [2024-11-08 22:54:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:03,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:54:03,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:03,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:54:03,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:54:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:03,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:54:03,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-08 22:54:03,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:54:03,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:54:03,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645906220] [2024-11-08 22:54:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645906220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:03,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:54:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71872646] [2024-11-08 22:54:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:03,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:54:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:54:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:54:03,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:03,498 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:54:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:03,535 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-11-08 22:54:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:54:03,538 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-08 22:54:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:03,547 INFO L225 Difference]: With dead ends: 119 [2024-11-08 22:54:03,547 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 22:54:03,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:54:03,563 INFO L432 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:03,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:54:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 22:54:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 22:54:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:54:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-08 22:54:03,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 139 [2024-11-08 22:54:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:03,613 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-08 22:54:03,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:54:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-08 22:54:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:54:03,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:03,621 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:03,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:54:03,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:54:03,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:03,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -176932552, now seen corresponding path program 1 times [2024-11-08 22:54:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103804027] [2024-11-08 22:54:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:54:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:03,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:54:03,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:54:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:04,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:54:04,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:54:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:54:04,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:54:04,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:54:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103804027] [2024-11-08 22:54:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103804027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:54:04,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:54:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:54:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922799191] [2024-11-08 22:54:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:54:04,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:54:04,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:54:04,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:54:04,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:54:04,125 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:54:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:54:04,192 INFO L93 Difference]: Finished difference Result 115 states and 173 transitions. [2024-11-08 22:54:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:54:04,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-08 22:54:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:54:04,205 INFO L225 Difference]: With dead ends: 115 [2024-11-08 22:54:04,206 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 22:54:04,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:54:04,208 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:54:04,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:54:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 22:54:04,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-08 22:54:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:54:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-08 22:54:04,237 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2024-11-08 22:54:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:54:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-08 22:54:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:54:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-08 22:54:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:54:04,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:54:04,247 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:54:04,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:54:04,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:54:04,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:54:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:54:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash -986279178, now seen corresponding path program 1 times [2024-11-08 22:54:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:54:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321049337] [2024-11-08 22:54:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:54:04,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:54:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:54:04,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:54:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:54:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:54:04,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 22:54:04,673 INFO L278 TraceCheckSpWp]: Computing forward predicates...