./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.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 cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:03:50,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:03:50,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:03:50,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:03:50,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:03:50,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:03:50,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:03:50,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:03:50,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:03:50,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:03:50,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:03:50,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:03:50,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:03:50,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:03:50,703 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:03:50,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:03:50,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:03:50,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:03:50,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:03:50,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:03:50,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:03:50,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:03:50,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:03:50,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:03:50,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:03:50,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:03:50,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:03:50,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:03:50,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:03:50,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:03:50,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:03:50,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:03:50,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:03:50,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:03:50,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:03:50,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:03:50,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:03:50,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:03:50,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:03:50,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:03:50,716 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:03:50,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:03:50,717 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 -> cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 [2024-11-16 13:03:51,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:03:51,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:03:51,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:03:51,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:03:51,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:03:51,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-16 13:03:52,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:03:52,700 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:03:52,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-16 13:03:52,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d50b060b/5341c7bebb644f4c8746e1076e155292/FLAGadeca6192 [2024-11-16 13:03:52,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d50b060b/5341c7bebb644f4c8746e1076e155292 [2024-11-16 13:03:52,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:03:52,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:03:52,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:03:52,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:03:52,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:03:52,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:03:52" (1/1) ... [2024-11-16 13:03:52,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f2056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:52, skipping insertion in model container [2024-11-16 13:03:52,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:03:52" (1/1) ... [2024-11-16 13:03:52,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:03:52,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-16 13:03:53,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:03:53,053 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:03:53,063 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-16 13:03:53,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:03:53,129 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:03:53,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53 WrapperNode [2024-11-16 13:03:53,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:03:53,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:03:53,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:03:53,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:03:53,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,210 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-16 13:03:53,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:03:53,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:03:53,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:03:53,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:03:53,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:03:53,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:03:53,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:03:53,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:03:53,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:03:53,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (1/1) ... [2024-11-16 13:03:53,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:03:53,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:03:53,383 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:03:53,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:03:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:03:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:03:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:03:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:03:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:03:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:03:53,516 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:03:53,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:03:54,036 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2024-11-16 13:03:54,075 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 13:03:54,075 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:03:54,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:03:54,114 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:03:54,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:03:54 BoogieIcfgContainer [2024-11-16 13:03:54,114 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:03:54,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:03:54,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:03:54,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:03:54,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:03:52" (1/3) ... [2024-11-16 13:03:54,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400cc63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:03:54, skipping insertion in model container [2024-11-16 13:03:54,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:03:53" (2/3) ... [2024-11-16 13:03:54,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400cc63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:03:54, skipping insertion in model container [2024-11-16 13:03:54,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:03:54" (3/3) ... [2024-11-16 13:03:54,123 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-16 13:03:54,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:03:54,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:03:54,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:03:54,215 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;@66af1ff5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:03:54,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:03:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:03:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 13:03:54,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:54,240 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:54,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:54,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1536858135, now seen corresponding path program 1 times [2024-11-16 13:03:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:54,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970541782] [2024-11-16 13:03:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:54,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970541782] [2024-11-16 13:03:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970541782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:54,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:54,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:03:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340562658] [2024-11-16 13:03:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:54,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:03:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:03:54,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:03:54,805 INFO L87 Difference]: Start difference. First operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 64 states have internal predecessors, (88), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:03:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:54,848 INFO L93 Difference]: Finished difference Result 164 states and 269 transitions. [2024-11-16 13:03:54,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:03:54,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 139 [2024-11-16 13:03:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:54,859 INFO L225 Difference]: With dead ends: 164 [2024-11-16 13:03:54,860 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 13:03:54,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:03:54,870 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:54,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:03:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 13:03:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 13:03:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:03:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2024-11-16 13:03:54,919 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 139 [2024-11-16 13:03:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:54,919 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2024-11-16 13:03:54,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:03:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2024-11-16 13:03:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 13:03:54,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:54,926 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:54,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:03:54,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash -861149937, now seen corresponding path program 1 times [2024-11-16 13:03:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:54,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992917701] [2024-11-16 13:03:54,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:55,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992917701] [2024-11-16 13:03:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992917701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:55,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:55,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:03:55,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265022563] [2024-11-16 13:03:55,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:55,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:03:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:55,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:03:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:03:55,366 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:55,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:55,427 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2024-11-16 13:03:55,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:03:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-16 13:03:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:55,432 INFO L225 Difference]: With dead ends: 159 [2024-11-16 13:03:55,432 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 13:03:55,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:03:55,434 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:55,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:03:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 13:03:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 13:03:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:03:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-16 13:03:55,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 139 [2024-11-16 13:03:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:55,449 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-16 13:03:55,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-16 13:03:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 13:03:55,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:55,452 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:55,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:03:55,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:55,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash -618383824, now seen corresponding path program 1 times [2024-11-16 13:03:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021341891] [2024-11-16 13:03:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021341891] [2024-11-16 13:03:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021341891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:55,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:03:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086858594] [2024-11-16 13:03:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:03:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:03:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:03:55,921 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:56,134 INFO L93 Difference]: Finished difference Result 239 states and 353 transitions. [2024-11-16 13:03:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:03:56,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-16 13:03:56,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:56,141 INFO L225 Difference]: With dead ends: 239 [2024-11-16 13:03:56,141 INFO L226 Difference]: Without dead ends: 161 [2024-11-16 13:03:56,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:03:56,143 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 92 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:56,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 307 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:03:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-16 13:03:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2024-11-16 13:03:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 99 states have internal predecessors, (131), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 13:03:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2024-11-16 13:03:56,181 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 140 [2024-11-16 13:03:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 211 transitions. [2024-11-16 13:03:56,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 211 transitions. [2024-11-16 13:03:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 13:03:56,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:56,184 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:03:56,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 6270312, now seen corresponding path program 1 times [2024-11-16 13:03:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:56,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624039660] [2024-11-16 13:03:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624039660] [2024-11-16 13:03:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624039660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:03:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396069157] [2024-11-16 13:03:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:56,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:03:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:56,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:03:56,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:03:56,495 INFO L87 Difference]: Start difference. First operand 142 states and 211 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:56,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:56,701 INFO L93 Difference]: Finished difference Result 338 states and 499 transitions. [2024-11-16 13:03:56,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:03:56,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-16 13:03:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:56,707 INFO L225 Difference]: With dead ends: 338 [2024-11-16 13:03:56,707 INFO L226 Difference]: Without dead ends: 245 [2024-11-16 13:03:56,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:03:56,709 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 131 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:56,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 334 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:03:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-16 13:03:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 224. [2024-11-16 13:03:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 13:03:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2024-11-16 13:03:56,758 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 141 [2024-11-16 13:03:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:56,760 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2024-11-16 13:03:56,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2024-11-16 13:03:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 13:03:56,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:56,764 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:56,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:03:56,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:56,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2131111373, now seen corresponding path program 1 times [2024-11-16 13:03:56,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:56,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160423888] [2024-11-16 13:03:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:57,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:57,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160423888] [2024-11-16 13:03:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160423888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 13:03:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200241627] [2024-11-16 13:03:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:03:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:03:57,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:03:57,147 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:57,476 INFO L93 Difference]: Finished difference Result 633 states and 927 transitions. [2024-11-16 13:03:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 13:03:57,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-16 13:03:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:57,481 INFO L225 Difference]: With dead ends: 633 [2024-11-16 13:03:57,481 INFO L226 Difference]: Without dead ends: 469 [2024-11-16 13:03:57,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-16 13:03:57,486 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 287 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:57,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 676 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:03:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-16 13:03:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 396. [2024-11-16 13:03:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 290 states have (on average 1.3448275862068966) internal successors, (390), 290 states have internal predecessors, (390), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 13:03:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 590 transitions. [2024-11-16 13:03:57,545 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 590 transitions. Word has length 142 [2024-11-16 13:03:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:57,546 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 590 transitions. [2024-11-16 13:03:57,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 590 transitions. [2024-11-16 13:03:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 13:03:57,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:57,549 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:57,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:03:57,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:57,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:57,550 INFO L85 PathProgramCache]: Analyzing trace with hash 366904564, now seen corresponding path program 1 times [2024-11-16 13:03:57,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:57,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911866322] [2024-11-16 13:03:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:57,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:57,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911866322] [2024-11-16 13:03:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911866322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:58,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:03:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352380398] [2024-11-16 13:03:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:58,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:03:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:03:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:03:58,012 INFO L87 Difference]: Start difference. First operand 396 states and 590 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:58,225 INFO L93 Difference]: Finished difference Result 810 states and 1195 transitions. [2024-11-16 13:03:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:03:58,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-16 13:03:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:58,229 INFO L225 Difference]: With dead ends: 810 [2024-11-16 13:03:58,229 INFO L226 Difference]: Without dead ends: 463 [2024-11-16 13:03:58,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:03:58,232 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:58,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 307 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:03:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-16 13:03:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 404. [2024-11-16 13:03:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 298 states have (on average 1.332214765100671) internal successors, (397), 298 states have internal predecessors, (397), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 13:03:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 597 transitions. [2024-11-16 13:03:58,276 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 597 transitions. Word has length 142 [2024-11-16 13:03:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:58,276 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 597 transitions. [2024-11-16 13:03:58,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 597 transitions. [2024-11-16 13:03:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:03:58,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:58,281 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:58,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 13:03:58,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:58,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash -42082832, now seen corresponding path program 1 times [2024-11-16 13:03:58,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:58,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141123802] [2024-11-16 13:03:58,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:58,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141123802] [2024-11-16 13:03:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141123802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:03:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073727022] [2024-11-16 13:03:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:03:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:58,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:03:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:03:58,622 INFO L87 Difference]: Start difference. First operand 404 states and 597 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:58,705 INFO L93 Difference]: Finished difference Result 781 states and 1143 transitions. [2024-11-16 13:03:58,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:03:58,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 13:03:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:58,709 INFO L225 Difference]: With dead ends: 781 [2024-11-16 13:03:58,709 INFO L226 Difference]: Without dead ends: 420 [2024-11-16 13:03:58,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:03:58,712 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 109 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:58,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 222 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:03:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-16 13:03:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-16 13:03:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 310 states have (on average 1.303225806451613) internal successors, (404), 310 states have internal predecessors, (404), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 13:03:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 604 transitions. [2024-11-16 13:03:58,765 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 604 transitions. Word has length 143 [2024-11-16 13:03:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 604 transitions. [2024-11-16 13:03:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 604 transitions. [2024-11-16 13:03:58,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:03:58,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:58,767 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:58,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 13:03:58,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2119292175, now seen corresponding path program 1 times [2024-11-16 13:03:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995509585] [2024-11-16 13:03:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995509585] [2024-11-16 13:03:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995509585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:59,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:59,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:03:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204412808] [2024-11-16 13:03:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:03:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:03:59,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:03:59,182 INFO L87 Difference]: Start difference. First operand 420 states and 604 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:03:59,494 INFO L93 Difference]: Finished difference Result 1062 states and 1522 transitions. [2024-11-16 13:03:59,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:03:59,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 13:03:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:03:59,499 INFO L225 Difference]: With dead ends: 1062 [2024-11-16 13:03:59,499 INFO L226 Difference]: Without dead ends: 687 [2024-11-16 13:03:59,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:03:59,502 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 134 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:03:59,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 458 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:03:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-16 13:03:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 593. [2024-11-16 13:03:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 439 states have (on average 1.3006833712984054) internal successors, (571), 439 states have internal predecessors, (571), 140 states have call successors, (140), 13 states have call predecessors, (140), 13 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-16 13:03:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 851 transitions. [2024-11-16 13:03:59,585 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 851 transitions. Word has length 143 [2024-11-16 13:03:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:03:59,586 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 851 transitions. [2024-11-16 13:03:59,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:03:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 851 transitions. [2024-11-16 13:03:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 13:03:59,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:03:59,588 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:03:59,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 13:03:59,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:03:59,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:03:59,589 INFO L85 PathProgramCache]: Analyzing trace with hash -874527694, now seen corresponding path program 1 times [2024-11-16 13:03:59,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:03:59,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506494067] [2024-11-16 13:03:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:03:59,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:03:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:03:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:03:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:03:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:03:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:03:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:03:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:03:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:03:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:03:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:03:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:03:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:03:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:03:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:03:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:03:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:03:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:03:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:03:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:03:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:03:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:03:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:03:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:03:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506494067] [2024-11-16 13:03:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506494067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:03:59,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:03:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:03:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151573039] [2024-11-16 13:03:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:03:59,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:03:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:03:59,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:03:59,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:03:59,903 INFO L87 Difference]: Start difference. First operand 593 states and 851 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:04:00,147 INFO L93 Difference]: Finished difference Result 1237 states and 1785 transitions. [2024-11-16 13:04:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:04:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 13:04:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:04:00,153 INFO L225 Difference]: With dead ends: 1237 [2024-11-16 13:04:00,153 INFO L226 Difference]: Without dead ends: 746 [2024-11-16 13:04:00,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:04:00,155 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 43 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:04:00,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 525 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:04:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-16 13:04:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 671. [2024-11-16 13:04:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 517 states have (on average 1.311411992263056) internal successors, (678), 517 states have internal predecessors, (678), 140 states have call successors, (140), 13 states have call predecessors, (140), 13 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-16 13:04:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 958 transitions. [2024-11-16 13:04:00,236 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 958 transitions. Word has length 143 [2024-11-16 13:04:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:04:00,237 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 958 transitions. [2024-11-16 13:04:00,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 958 transitions. [2024-11-16 13:04:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 13:04:00,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:00,251 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:00,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 13:04:00,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:00,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:00,252 INFO L85 PathProgramCache]: Analyzing trace with hash -26065621, now seen corresponding path program 1 times [2024-11-16 13:04:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:04:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523444985] [2024-11-16 13:04:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:04:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:04:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968171944] [2024-11-16 13:04:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:00,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:04:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:04:00,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:04:00,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 13:04:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:00,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 13:04:00,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:04:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-16 13:04:01,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:04:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:04:01,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523444985] [2024-11-16 13:04:01,758 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:04:01,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968171944] [2024-11-16 13:04:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968171944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:04:01,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:04:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-16 13:04:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930253420] [2024-11-16 13:04:01,759 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 13:04:01,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 13:04:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:04:01,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 13:04:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:04:01,761 INFO L87 Difference]: Start difference. First operand 671 states and 958 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:04:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:04:02,477 INFO L93 Difference]: Finished difference Result 1629 states and 2275 transitions. [2024-11-16 13:04:02,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 13:04:02,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2024-11-16 13:04:02,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:04:02,486 INFO L225 Difference]: With dead ends: 1629 [2024-11-16 13:04:02,486 INFO L226 Difference]: Without dead ends: 1205 [2024-11-16 13:04:02,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-16 13:04:02,489 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 151 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 13:04:02,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 454 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 13:04:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2024-11-16 13:04:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1145. [2024-11-16 13:04:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 883 states have (on average 1.2967157417893544) internal successors, (1145), 887 states have internal predecessors, (1145), 228 states have call successors, (228), 33 states have call predecessors, (228), 33 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-16 13:04:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1601 transitions. [2024-11-16 13:04:02,621 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1601 transitions. Word has length 148 [2024-11-16 13:04:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:04:02,622 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1601 transitions. [2024-11-16 13:04:02,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:04:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1601 transitions. [2024-11-16 13:04:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 13:04:02,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:02,624 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:02,643 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-16 13:04:02,824 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,SelfDestructingSolverStorable9 [2024-11-16 13:04:02,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:02,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 695819469, now seen corresponding path program 1 times [2024-11-16 13:04:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:04:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450940508] [2024-11-16 13:04:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:04:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:04:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:04:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:04:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:04:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:04:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:04:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 13:04:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:04:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:04:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 13:04:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 13:04:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 13:04:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:04:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 13:04:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:04:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:04:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:04:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:04:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 13:04:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:04:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:04:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:04:03,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450940508] [2024-11-16 13:04:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450940508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:04:03,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:04:03,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:04:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220225137] [2024-11-16 13:04:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:04:03,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:04:03,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:04:03,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:04:03,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:04:03,074 INFO L87 Difference]: Start difference. First operand 1145 states and 1601 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:04:03,266 INFO L93 Difference]: Finished difference Result 1985 states and 2799 transitions. [2024-11-16 13:04:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:04:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-11-16 13:04:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:04:03,277 INFO L225 Difference]: With dead ends: 1985 [2024-11-16 13:04:03,277 INFO L226 Difference]: Without dead ends: 1527 [2024-11-16 13:04:03,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 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-16 13:04:03,279 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 72 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:04:03,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 452 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:04:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-16 13:04:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1148. [2024-11-16 13:04:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 886 states have (on average 1.2957110609480813) internal successors, (1148), 890 states have internal predecessors, (1148), 228 states have call successors, (228), 33 states have call predecessors, (228), 33 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-16 13:04:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1604 transitions. [2024-11-16 13:04:03,435 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1604 transitions. Word has length 148 [2024-11-16 13:04:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:04:03,435 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1604 transitions. [2024-11-16 13:04:03,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1604 transitions. [2024-11-16 13:04:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 13:04:03,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:03,438 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:03,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 13:04:03,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:03,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:03,439 INFO L85 PathProgramCache]: Analyzing trace with hash 185285292, now seen corresponding path program 1 times [2024-11-16 13:04:03,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:04:03,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067857415] [2024-11-16 13:04:03,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:04:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:04:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995172881] [2024-11-16 13:04:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:03,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:04:03,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:04:03,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 13:04:03,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 13:04:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:04:03,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:04:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:04:03,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:04:03,857 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:04:03,859 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:04:03,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 13:04:04,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 13:04:04,065 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:04,174 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:04:04,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:04:04 BoogieIcfgContainer [2024-11-16 13:04:04,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:04:04,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:04:04,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:04:04,178 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:04:04,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:03:54" (3/4) ... [2024-11-16 13:04:04,182 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:04:04,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:04:04,184 INFO L158 Benchmark]: Toolchain (without parser) took 11447.97ms. Allocated memory was 155.2MB in the beginning and 343.9MB in the end (delta: 188.7MB). Free memory was 100.4MB in the beginning and 212.4MB in the end (delta: -112.1MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2024-11-16 13:04:04,184 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:04:04,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.52ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 82.7MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 13:04:04,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.74ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 75.4MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:04:04,185 INFO L158 Benchmark]: Boogie Preprocessor took 130.88ms. Allocated memory is still 155.2MB. Free memory was 75.4MB in the beginning and 122.9MB in the end (delta: -47.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-16 13:04:04,185 INFO L158 Benchmark]: IcfgBuilder took 771.66ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 122.8MB in the beginning and 172.1MB in the end (delta: -49.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-11-16 13:04:04,186 INFO L158 Benchmark]: TraceAbstraction took 10059.82ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 172.1MB in the beginning and 212.4MB in the end (delta: -40.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-11-16 13:04:04,186 INFO L158 Benchmark]: Witness Printer took 5.87ms. Allocated memory is still 343.9MB. Free memory is still 212.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:04:04,187 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.26ms. Allocated memory is still 155.2MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.52ms. Allocated memory is still 155.2MB. Free memory was 100.4MB in the beginning and 82.7MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.74ms. Allocated memory is still 155.2MB. Free memory was 82.3MB in the beginning and 75.4MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.88ms. Allocated memory is still 155.2MB. Free memory was 75.4MB in the beginning and 122.9MB in the end (delta: -47.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * IcfgBuilder took 771.66ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 122.8MB in the beginning and 172.1MB in the end (delta: -49.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10059.82ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 172.1MB in the beginning and 212.4MB in the end (delta: -40.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 5.87ms. Allocated memory is still 343.9MB. Free memory is still 212.4MB. 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 137, overapproximation of bitwiseOr at line 137, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] signed short int var_1_25 = 8; [L45] unsigned short int var_1_26 = 10; [L46] signed short int var_1_27 = -4; [L47] double var_1_28 = 0.5; [L48] unsigned char last_1_var_1_3 = 64; [L49] unsigned short int last_1_var_1_6 = 10; [L50] unsigned short int last_1_var_1_15 = 5; [L51] unsigned short int last_1_var_1_20 = 50; [L52] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L130] last_1_var_1_3 = var_1_3 [L131] last_1_var_1_6 = var_1_6 [L132] last_1_var_1_15 = var_1_15 [L133] last_1_var_1_20 = var_1_20 [L134] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L98] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L98] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L101] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L101] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L102] var_1_9 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L103] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L104] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L104] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L105] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L105] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L106] var_1_10 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L107] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L108] var_1_11 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L110] var_1_12 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L111] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L112] var_1_13 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L113] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L114] var_1_14 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L115] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L116] var_1_17 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L117] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L118] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L118] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L119] var_1_18 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L120] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L121] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L121] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L122] var_1_19 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L123] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L124] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L124] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L125] var_1_23 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L126] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L127] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=256, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=256, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L127] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=256, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L145] RET updateVariables() [L146] CALL step() [L56] var_1_22 = var_1_23 [L57] var_1_24 = var_1_22 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L58] COND FALSE !(var_1_23 > ((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L61] var_1_26 = var_1_23 [L62] var_1_27 = var_1_22 [L63] var_1_28 = 50.5 [L64] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L65] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L68] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L68] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L69] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=-124, stepLocal_2=2, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L70] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=-124, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L73] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L77] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_8=15/8, var_1_9=67] [L78] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L79] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=-4, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L85] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L86] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L87] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L88] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L88] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L91] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L92] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L137] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L137] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L137] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L137-L138] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=275, var_1_16=1, var_1_17=-29, var_1_18=0, var_1_19=30, var_1_1=1, var_1_20=143, var_1_21=0, var_1_22=256, var_1_23=256, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=399, var_1_5=-124, var_1_6=10, var_1_9=67] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1107 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1103 mSDsluCounter, 4183 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2807 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 922 IncrementalHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 1376 mSDtfsCounter, 922 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1148occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 780 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2012 NumberOfCodeBlocks, 2012 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1557 ConstructedInterpolants, 0 QuantifiedInterpolants, 4661 SizeOfPredicates, 3 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 8312/8360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 13:04:04,213 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_fillercodesize_ps-cn-10_file-78.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 cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:04:06,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:04:06,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:04:06,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:04:06,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:04:06,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:04:06,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:04:06,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:04:06,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:04:06,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:04:06,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:04:06,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:04:06,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:04:06,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:04:06,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:04:06,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:04:06,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:04:06,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:04:06,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:04:06,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:04:06,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:04:06,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:04:06,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:04:06,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:04:06,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:04:06,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:04:06,705 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:04:06,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:04:06,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:04:06,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:04:06,706 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:04:06,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:04:06,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:04:06,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:04:06,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:04:06,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:04:06,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:04:06,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:04:06,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:04:06,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:04:06,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:04:06,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:04:06,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:04:06,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:04:06,710 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 -> cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 [2024-11-16 13:04:07,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:04:07,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:04:07,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:04:07,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:04:07,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:04:07,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-16 13:04:08,658 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:04:08,915 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:04:08,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-16 13:04:08,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c5ff08c/739fa77bfc6c43e6a0a162e52f6e93d1/FLAG1d302a2df [2024-11-16 13:04:08,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c5ff08c/739fa77bfc6c43e6a0a162e52f6e93d1 [2024-11-16 13:04:08,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:04:08,954 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:04:08,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:04:08,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:04:08,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:04:08,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:04:08" (1/1) ... [2024-11-16 13:04:08,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5d22cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:08, skipping insertion in model container [2024-11-16 13:04:08,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:04:08" (1/1) ... [2024-11-16 13:04:09,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:04:09,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-16 13:04:09,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:04:09,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:04:09,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-16 13:04:09,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:04:09,409 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:04:09,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09 WrapperNode [2024-11-16 13:04:09,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:04:09,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:04:09,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:04:09,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:04:09,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,484 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-16 13:04:09,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:04:09,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:04:09,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:04:09,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:04:09,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,536 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 13:04:09,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:04:09,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:04:09,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:04:09,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:04:09,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (1/1) ... [2024-11-16 13:04:09,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:04:09,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:04:09,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 13:04:09,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 13:04:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:04:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:04:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:04:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:04:09,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:04:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:04:09,771 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:04:09,775 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:04:15,544 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 13:04:15,544 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:04:15,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:04:15,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:04:15,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:04:15 BoogieIcfgContainer [2024-11-16 13:04:15,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:04:15,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:04:15,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:04:15,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:04:15,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:04:08" (1/3) ... [2024-11-16 13:04:15,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276a8253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:04:15, skipping insertion in model container [2024-11-16 13:04:15,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:04:09" (2/3) ... [2024-11-16 13:04:15,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276a8253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:04:15, skipping insertion in model container [2024-11-16 13:04:15,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:04:15" (3/3) ... [2024-11-16 13:04:15,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-16 13:04:15,598 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:04:15,599 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:04:15,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:04:15,696 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;@76038dd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:04:15,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:04:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:04:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 13:04:15,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:15,720 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:15,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:15,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -886180781, now seen corresponding path program 1 times [2024-11-16 13:04:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:04:15,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26961468] [2024-11-16 13:04:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:04:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:04:15,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:04:15,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 13:04:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:16,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:04:16,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:04:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-16 13:04:16,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:04:16,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:04:16,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26961468] [2024-11-16 13:04:16,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26961468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:04:16,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:04:16,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:04:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115862208] [2024-11-16 13:04:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:04:16,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:04:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:04:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:04:16,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:04:16,343 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:04:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:04:16,377 INFO L93 Difference]: Finished difference Result 124 states and 205 transitions. [2024-11-16 13:04:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:04:16,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-11-16 13:04:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:04:16,386 INFO L225 Difference]: With dead ends: 124 [2024-11-16 13:04:16,387 INFO L226 Difference]: Without dead ends: 61 [2024-11-16 13:04:16,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:04:16,394 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-16 13:04:16,396 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-16 13:04:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-16 13:04:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-16 13:04:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 13:04:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-16 13:04:16,440 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 133 [2024-11-16 13:04:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:04:16,441 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-16 13:04:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 13:04:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-16 13:04:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 13:04:16,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:16,444 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:16,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:04:16,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:04:16,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:16,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1422575097, now seen corresponding path program 1 times [2024-11-16 13:04:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:04:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442786913] [2024-11-16 13:04:16,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:04:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:04:16,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:04:16,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 13:04:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:17,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:04:17,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:04:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:04:19,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:04:19,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:04:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442786913] [2024-11-16 13:04:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442786913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:04:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:04:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 13:04:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436009065] [2024-11-16 13:04:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:04:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:04:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:04:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:04:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:04:19,734 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:24,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:26,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:30,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:04:34,937 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-16 13:04:34,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:04:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-16 13:04:34,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:04:34,975 INFO L225 Difference]: With dead ends: 192 [2024-11-16 13:04:34,975 INFO L226 Difference]: Without dead ends: 134 [2024-11-16 13:04:34,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:04:34,977 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 69 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:04:34,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 305 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 15.0s Time] [2024-11-16 13:04:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-16 13:04:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2024-11-16 13:04:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 73 states have internal predecessors, (90), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 13:04:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-16 13:04:35,019 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 133 [2024-11-16 13:04:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:04:35,020 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-16 13:04:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-16 13:04:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 13:04:35,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:35,025 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:35,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 13:04:35,225 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-16 13:04:35,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:35,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:35,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1129172090, now seen corresponding path program 1 times [2024-11-16 13:04:35,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:04:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147092358] [2024-11-16 13:04:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:35,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:04:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:04:35,231 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-16 13:04:35,233 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-16 13:04:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:35,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:04:35,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:04:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:04:35,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:04:35,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:04:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147092358] [2024-11-16 13:04:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147092358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:04:35,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:04:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:04:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485950088] [2024-11-16 13:04:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:04:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:04:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:04:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:04:35,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:04:35,646 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:39,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 13:04:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:04:39,856 INFO L93 Difference]: Finished difference Result 174 states and 255 transitions. [2024-11-16 13:04:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:04:39,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-16 13:04:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:04:39,892 INFO L225 Difference]: With dead ends: 174 [2024-11-16 13:04:39,892 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 13:04:39,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:04:39,894 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:04:39,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-16 13:04:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 13:04:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-16 13:04:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 13:04:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-16 13:04:39,930 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 133 [2024-11-16 13:04:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:04:39,931 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-16 13:04:39,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-16 13:04:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 13:04:39,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:04:39,934 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:04:39,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 13:04:40,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:04:40,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:04:40,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:04:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 135598184, now seen corresponding path program 1 times [2024-11-16 13:04:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:04:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484061274] [2024-11-16 13:04:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:04:40,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:04:40,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:04:40,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:04:40,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 13:04:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:04:40,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 13:04:40,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:04:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:04:43,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:04:43,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:04:43,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484061274] [2024-11-16 13:04:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484061274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:04:43,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:04:43,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:04:43,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820595909] [2024-11-16 13:04:43,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:04:43,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:04:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:04:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:04:43,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:04:43,229 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:04:46,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:48,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:52,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:54,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:04:57,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:05:01,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:05:03,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:05:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:05:03,145 INFO L93 Difference]: Finished difference Result 314 states and 449 transitions. [2024-11-16 13:05:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 13:05:03,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-16 13:05:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:05:03,183 INFO L225 Difference]: With dead ends: 314 [2024-11-16 13:05:03,183 INFO L226 Difference]: Without dead ends: 256 [2024-11-16 13:05:03,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:05:03,186 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 161 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:05:03,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 316 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 270 Invalid, 1 Unknown, 0 Unchecked, 19.7s Time] [2024-11-16 13:05:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-16 13:05:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2024-11-16 13:05:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 131 states have (on average 1.183206106870229) internal successors, (155), 131 states have internal predecessors, (155), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-16 13:05:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 315 transitions. [2024-11-16 13:05:03,237 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 315 transitions. Word has length 134 [2024-11-16 13:05:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:05:03,238 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 315 transitions. [2024-11-16 13:05:03,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 13:05:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 315 transitions. [2024-11-16 13:05:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 13:05:03,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:05:03,241 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:05:03,260 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 (5)] Forceful destruction successful, exit code 0 [2024-11-16 13:05:03,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:05:03,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:05:03,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:05:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1023101865, now seen corresponding path program 1 times [2024-11-16 13:05:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:05:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042267628] [2024-11-16 13:05:03,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:03,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:05:03,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:05:03,446 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:05:03,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 13:05:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:04,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 13:05:04,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:05:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 343 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 13:05:07,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:05:10,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:05:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042267628] [2024-11-16 13:05:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042267628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:05:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [791021092] [2024-11-16 13:05:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:05:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 13:05:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 13:05:10,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 13:05:10,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 13:05:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:05:11,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 13:05:11,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:05:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 13:05:13,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:05:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [791021092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:05:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:05:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-16 13:05:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12820736] [2024-11-16 13:05:13,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:05:13,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:05:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:05:13,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:05:13,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-16 13:05:13,110 INFO L87 Difference]: Start difference. First operand 216 states and 315 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)